Analysis of upper bounds for the pallet loading problem

DOI10.1016/S0377-2217(00)00163-6MaRDI QIDQ5939589zbMATH OpenWikidataFDO

Authors Adam N. Letchford, André R. S. Amaral

Publication date 2001

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

Full work available at URL https://doi.org/10.1016/S0377-2217(00)00163-6

zbMATH Keywords

linear programming relaxationPackingpacking identical boxes into rectangular palletsPallet loading problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• How to use structural constraints to compute an upper bound for the pallet loading problem
• scientific article; zbMATH DE number 3945878
• Determining an upper bound for a class of rectangular packing problems
• Solving the pallet loading problem
• scientific article; zbMATH DE number 1873246

Cites work

• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
• A simple and effective recursive procedure for the manufacturer's pallet loading problem
• A typology of cutting and packing problems
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• An exact algorithm for the pallet loading problem
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• 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
• Incidence matrices and interval graphs
• Packing the maximum number of m n tiles in a large p q rectangle
• Practical Considerations of the Pallet-Loading Problem
• The G4-Heuristic for the Pallet Loading 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

Cited in

(18)

• Determining an upper bound for a class of rectangular packing problems
• How to use structural constraints to compute an upper bound for the pallet loading problem
• 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)
• A branch-and-cut algorithm for the pallet loading problem
• The geometry of nesting problems: a tutorial
• Solving the pallet loading problem
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• A new upper bound for the cylinder packing problem
• The pallet loading problem: a review of solution methods and computational experiments
• A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem
• A note on an L-approach for solving the manufacturer's pallet loading problem
• One-dimensional relaxations and LP bounds for orthogonal packing
• The pinwheel pattern and its application to the manufacturer's pallet-loading problem
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• scientific article; zbMATH DE number 1873246 (Why is no real title available?)
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• 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

This page was built for publication: Analysis of upper bounds for the pallet loading problem

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