An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- 1 May 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 83 (1) , 39-56
- https://doi.org/10.1016/0377-2217(93)e0278-6
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Cutting stock problems and solution proceduresEuropean Journal of Operational Research, 1991
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock ProblemJournal of the Operational Research Society, 1990
- An approach to two-dimensional cutting stock problemsInternational Journal of Production Research, 1987
- Algorithms for Unconstrained Two-Dimensional Guillotine CuttingJournal of the Operational Research Society, 1985
- Network flows and non-guillotine cutting patternsEuropean Journal of Operational Research, 1984
- A Note on a Combined Approach to the Pallet Loading ProblemIIE Transactions, 1983
- An Application of the Micro to Product Design and DistributionJournal of the Operational Research Society, 1982
- A Combined Approach to the Pallet Loading ProblemIIE Transactions, 1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- An Algorithm to Optimize the Layout of Boxes in PalletsJournal of the Operational Research Society, 1980