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 …

Benders decomposition uses a strategy of``learning from one's mistakes.''The aim of this
paper is to extend this strategy to a much larger class of problems. The key is to generalize …

This paper addresses the Single Container Loading Problem. We present an exact
approach that considers the resolution of integer linear programming and constraint …

The parallel processor scheduling and bin packing problems with contiguity constraints are
important in the field of combinatorial optimization because both problems can be used as …

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 …

A capacitated vehicle routing problem with two-dimensional loading constraints is
addressed. Associated with each customer are a set of rectangular items, the total weight of …

An aircraft hangar maintenance scheduling problem is studied, motivated by the aircraft
heavy maintenance conducted in a hangar operated by an independent maintenance …

Abstract Aircraft Maintenance Repair and Overhaul (MRO) is essential to ensure aviation
safety and air transport operations. An aircraft has to temporally suspend its service and …

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 …

This paper considers the on-time guillotine cutting of small rectangular items from large
rectangular bins. Items assigned to a bin define the bins' processing time. Consequently, an …