Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- 1 December 1974
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 3 (4) , 299-325
- https://doi.org/10.1137/0203025
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Fast algorithms for bin packingPublished by Elsevier ,2007
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Loading ProblemManagement Science, 1971
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963