Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …

Major advances were recently obtained in the exact solution of vehicle routing problems
(VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical …

Train timetabling and rolling stock circulation planning are two important optimization
problems that arise in the daily operations of urban rail transit lines. This study proposes a …

Mixed-integer linear programming (MILP) has become a cornerstone of operations research.
This is driven by the enhanced efficiency of modern solvers, which can today find globally …

We study pseudo-polynomial formulations for the classical bin packing and cutting stock
problems. We first propose an overview of dominance and equivalence relations among the …

We study an extension of the classical Bin Packing Problem, where each item consumes the
bin capacity during a given time window that depends on the item itself. The problem asks …

In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated
vehicle routing problem in which delivery of products from a depot to customers is performed …

We tackle the problem of coordinating a three-echelon last-mile delivery system. In the first
echelon, trucks transport parcels from distribution centres outside the city to public transport …

Satellite scheduling is concerned with the assignment of start and finish times for tasks while
considering the mission objective, available resources, and constraints. This scheduling …