Resource augmentation in two-dimensional packing with orthogonal rotations
From MaRDI portal
Publication:2583714
DOI10.1016/j.orl.2005.02.005zbMath1080.90062OpenAlexW2034802855WikidataQ65553922 ScholiaQ65553922MaRDI QIDQ2583714
Publication date: 18 January 2006
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.02.005
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Packing into the smallest square: worst-case analysis of lower bounds ⋮ Online square-into-square packing ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem
Cites Work
- Unnamed Item
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A algorithm for two-dimensional packing
- Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- LATIN 2004: Theoretical Informatics
This page was built for publication: Resource augmentation in two-dimensional packing with orthogonal rotations