An exact depth-first algorithm for the pallet loading problem

DOI10.1016/S0377-2217(97)00272-5zbMATH Open0946.90057MaRDI QIDQ1303552FDOQ1303552

Authors: Subir Bhattacharya, Sumita Bhattacharya, Rahul Roy 

Publication date: 16 September 1999

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

Recommendations

• Solving the pallet loading problem
• An exact algorithm for the pallet loading problem
• A fast algorithm for two-dimensional pallet loading problems of large size
• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem
• Practical Considerations of the Pallet-Loading Problem

zbMATH Keywords

optimizationpruningdepth-first searchpacking problems

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• 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 AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• Packing problems
• Loading Multiple Pallets
• How to use structural constraints to compute an upper bound for the pallet loading problem
• An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem

Cited In (10)

• A heuristic method based on Lagrangean relaxation for a manufacturer's pallet loading problem
• A fast algorithm for two-dimensional pallet loading problems of large size
• The minimum size instance of a Pallet Loading Problem equivalence class
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• The pinwheel pattern and its application to the manufacturer's pallet-loading problem
• A tabu search algorithm for the pallet loading problem
• A branch-and-cut algorithm for the pallet loading problem
• The pallet loading problem: a review of solution methods and computational experiments
• 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

This page was built for publication: An exact depth-first algorithm for the pallet loading problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1303552)