Logic-based Benders decomposition (LBBD) is a substantial generalization of classical
Benders decomposition that, in principle, allows the subproblem to be any optimization …

The potential benefits of using human resources efficiently in the service sector constitute an
incentive for decision makers in this industry to intelligently manage the work shifts of their …

We present an overview of the integration of constraint programming (CP) and operations
research (OR) to solve combinatorial optimization problems. We interpret CP and OR as …

This paper addresses a multi-activity multi-day shift scheduling problem in a continuous and
flexible environment including a heterogeneous workforce. Given days-off schedules …

The rotating workforce scheduling problem aims to schedule workers satisfying shift
sequence constraints and ensuring enough shifts are covered on each day, where every …

In this work, we present an exact approach for solving network design problems that is
based on an iterative graph aggregation procedure. The scheme allows existing preinstalled …

We consider a multi-activity shift scheduling problem where the objective is to construct
anonymous multi-activity shifts that respect union rules, satisfy the demand and minimize …

We address the solution of a very challenging (and previously unsolved) instance of the
quadratic 3-dimensional assignment problem, arising in digital wireless communications …

Network design problems are among the most-often studied problems in combinatorial
optimization. They posses a rich combinatorial structure that makes them interesting from a …

Current state-of-the-art MIP technology lacks a powerful modeling language based on
global constraints, a tool which has long been standard in constraint programming. In …