Analysis of upper bounds for the pallet loading problem
From MaRDI portal
Publication:5939589
DOI10.1016/S0377-2217(00)00163-6zbMath1054.90062WikidataQ57702385 ScholiaQ57702385MaRDI QIDQ5939589
André R. S. Amaral, Adam N. Letchford
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Packinglinear programming relaxationpacking identical boxes into rectangular palletsPallet loading problem
Related Items (12)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS ⋮ A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ The geometry of nesting problems: a tutorial ⋮ Solving the pallet loading problem ⋮ 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 ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ 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
Cites Work
- An instance of the cutting stock problem for which the rounding property does not hold
- Determining an upper bound for a class of rectangular packing problems
- Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for the pallet loading problem
- A typology of cutting and packing problems
- Incidence matrices and interval graphs
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A Linear Programming Approach to the Cutting-Stock Problem
- 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
- Practical Considerations of the Pallet-Loading Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- The G4-Heuristic for the Pallet Loading Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: Analysis of upper bounds for the pallet loading problem
