A branch-and-cut algorithm for the pallet loading problem

Authors:
R. Alvarez-Valdes;F. Parreño;J. M. Tamarit
Affiliations:
Department of Statistics and Operations Research, University of Valencia, Burjassot, Valencia, Spain;Departamento de Informatica, University of Castilla-La Mancha, E. Politecnica Superior, Campus Universitario, Albacete, Spain;Department of Statistics and Operations Research, University of Valencia, Burjassot, Valencia, Spain
Venue:
Computers and Operations Research
Year:
2005

Citing 7
Cited 1

Solving airline crew scheduling problems by branch-and-cut

Management Science
Wheel inequalities for stable set polytopes

Mathematical Programming: Series A and B
Rounding algorithms for covering problems

Mathematical Programming: Series A and B
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A branch-and-cut algorithm for the maximum cardinality stable set problem

Operations Research Letters
New facets for the set packing polytope

Operations Research Letters

Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a branch-and-cut algorithm for the pallet loading problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear description of its associated polyhedron. Finally, we exploit the specific structure of our problem to define the solution graph and to develop efficient separation procedures. We present computational results for the complete sets Cover I (up to 50 boxes) and Cover II (up to 100 boxes).