An exact depth-first algorithm for the pallet loading problem

DOI10.1016/S0377-2217(97)00272-5zbMath0946.90057MaRDI QIDQ1303552

Subir Bhattacharya, Sumita Bhattacharya, Rahul K. Roy

Publication date: 16 September 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationpruningdepth-first searchpacking problems

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, A fast algorithm for two-dimensional pallet loading problems of large size, Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, A branch-and-cut algorithm for the pallet loading problem, The pallet loading problem: a review of solution methods and computational experiments, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container

Cites Work

• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• How to use structural constraints to compute an upper bound for the pallet loading problem
• Packing problems
• An exact algorithm for the pallet loading problem
• A typology of cutting and packing problems
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
• An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Loading Multiple Pallets