High Multiplicity Strip Packing with Three Rectangle Types
- 1 April 2025
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 69 (2) , 1-37
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada (6636-548083-2020, RGPIN-2020-06423)
This publication has 14 references indexed in Scilit:
- A-approximation for strip packingComputational Geometry, 2014
- A note on the Kenyon–Remila strip-packing algorithmInformation Processing Letters, 2012
- Rectangle packing with one-dimensional resource augmentationDiscrete Optimization, 2009
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems2009
- An approximation scheme for strip packing of rectangles with bounded dimensionsDiscrete Applied Mathematics, 1998
- Reverse-Fit: A 2-optimal algorithm for packing rectangles1994
- An efficient approximation scheme for the one-dimensional bin-packing problem1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980