Determining an upper bound for a class of rectangular packing problems
From MaRDI portal
Publication:1086163
DOI10.1016/0305-0548(85)90044-9zbMath0608.90080OpenAlexW2013360405MaRDI QIDQ1086163
Publication date: 1985
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(85)90044-9
Related Items (13)
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem ⋮ A simulated annealing approach to the nesting problem in the textile manufacturing industry ⋮ Solving the pallet loading problem ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ 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 problems ⋮ Analysis of upper bounds for the pallet loading problem ⋮ A fast algorithm for two-dimensional pallet loading problems of large size ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ Upper bounds for the homogeneous case of a two-dimensional packing problem ⋮ The pallet loading problem: a review of solution methods and computational experiments ⋮ Heuristic methods and applications: A categorized survey ⋮ The pinwheel pattern and its application to the manufacturer's pallet-loading problem
Cites Work
- Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle
- Packing boxes with harmonic bricks
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
This page was built for publication: Determining an upper bound for a class of rectangular packing problems
