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 …

Network flow formulations are among the most successful tools to solve optimization
problems. Such formulations correspond to determining an optimal flow in a network. One …

The use of battery power is becoming widespread rapidly among the mega ports worldwide,
owing its low emission and high energy efficiency. In this paper, a simulation approach is …

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 …

This paper presents a study about the Capacitated Vehicle Routing Problem with Two-
Dimensional Loading Constraints (2L-CVRP) and its three variants: allowing split delivery …

The two-dimensional bin packing problem calls for packing a set of rectangular items into a
minimal set of larger rectangular bins. Items must be packed with their edges parallel to the …

Emergency department overcrowding is a global issue that poses a great threat to patient
health and safety. The timeliness of medical services provided to patients is crucial to …

We consider the multiple knapsack problem, that calls for the optimal assignment of a set of
items, each having a profit and a weight, to a set of knapsacks, each having a maximum …

In this paper, we address multiple container loading problems, consisting of placing
rectangular boxes, orthogonally and without overlapping, inside containers in order to …

This paper addresses the parallel machine scheduling problem with family dependent setup
times and total weighted completion time minimization. In this problem, when two jobs j and …