Two-dimensional packing problems: A survey
Top Cited Papers
- 1 September 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 141 (2) , 241-252
- https://doi.org/10.1016/s0377-2217(02)00123-6
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Heuristic algorithms for the three-dimensional bin packing problemEuropean Journal of Operational Research, 2002
- Guided local search and its application to the traveling salesman problemEuropean Journal of Operational Research, 1999
- Approximation algorithms for the oriented two-dimensional bin packing problemEuropean Journal of Operational Research, 1999
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cutsEuropean Journal of Operational Research, 1995
- An exact algorithm for general, orthogonal, two-dimensional knapsack problemsEuropean Journal of Operational Research, 1995
- An analytical model for the container loading problemEuropean Journal of Operational Research, 1995
- Some experiments with simulated annealing techniques for packing problemsEuropean Journal of Operational Research, 1993
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980