The Benders decomposition algorithm has been successfully applied to a wide range of
difficult optimization problems. This paper presents a state-of-the-art survey of this algorithm …

This paper gives a review on existing scheduling methodologies developed for process
industries. Above all, the aim of the paper is to focus on the industrial aspects of scheduling …

Multi-access edge computing (MEC) has recently emerged as a novel paradigm to facilitate
access to advanced computing capabilities at the edge of the network, in close proximity to …

This article describes new features and enhanced algorithms made available in version 5.0
of the SCIP Optimization Suite. In its central component, the constraint integer programming …

Abstract The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear
Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a …

Edge-cloud computing, combining the benefits of both edge computing and cloud
computing, is one of the most promising ways to address the resource insufficiency of smart …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Enterprise‐wide optimization (EWO) is a new emerging area that lies at the interface of
chemical engineering and operations research, and has become a major goal in the …

Mixed-integer programs (MIPs) involving logical implications modeled through big-M
coefficients are notoriously among the hardest to solve. In this paper, we propose and …

We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …