How to use structural constraints to compute an upper bound for the pallet loading problem

DOI10.1016/0377-2217(95)00030-TzbMath0928.90079OpenAlexW2063609096MaRDI QIDQ1127224

Josef Nelißen

Publication date: 13 August 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00030-t

zbMATH Keywords

pallet loadingupper bound methods

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

Solving the pallet loading problem ⋮ The minimum size instance of a Pallet Loading Problem equivalence class ⋮ 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 ⋮ Applying genetic algorithms and neural networks to the container 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 ⋮ An exact depth-first algorithm for the pallet loading problem

Cites Work

• Unnamed Item
• Ein neuer Ansatz zur Bestimmung theoretischer Obergrenzen für das zweidimensionale orthogonale homogene Packproblem. (A new approach to the determination of theoretical upper bounds for the two-dimensional orthogonal homogeneous packing problem)
• Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
• 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
• Upper bounds for the homogeneous case of a two-dimensional packing problem
• A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem

This page was built for publication: How to use structural constraints to compute an upper bound for the pallet loading problem