Average-case analysis of cutting and packing in two dimensions
- 1 January 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 44 (2) , 134-144
- https://doi.org/10.1016/0377-2217(90)90349-g
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- A provably efficient algorithm for dynamic storage allocationJournal of Computer and System Sciences, 1989
- Expected performance of the shelf heuristic for 2-dimensional packingOperations Research Letters, 1989
- Algorithms for Packing Squares: A Probabilistic AnalysisSIAM Journal on Computing, 1989
- Exact bounds for the stochastic upward matching problemTransactions of the American Mathematical Society, 1988
- The average-case analysis of some on-line algorithms for bin packingCombinatorica, 1986
- Shelf Algorithms for Two-Dimensional Packing ProblemsSIAM Journal on Computing, 1983
- A class of simple stochastic online bin packing algorithmsComputing, 1982
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- Two-dimensional packing: expected performance of simple level algorithmsInformation and Control, 1980