A 7160 theorem for bin packing
- 1 October 1985
- journal article
- Published by Elsevier BV in Journal of Complexity
- Vol. 1 (1), 65-106
- https://doi.org/10.1016/0885-064x(85)90022-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new proof for the first-fit decreasing bin-packing algorithmJournal of Algorithms, 1985
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Probabilistic analysis for simple one-and two-dimensional bin packing algorithmsInformation Processing Letters, 1980
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961