A typology of cutting and packing problems
- 13 January 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 44 (2) , 145-159
- https://doi.org/10.1016/0377-2217(90)90350-k
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Exact methods for the knapsack problem and its generalizationsPublished by Elsevier ,2011
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problemsOR Spectrum, 1988
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987
- Trim loss and related problemsOmega, 1985
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some InterconnectionsPublished by Elsevier ,1979
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- The Loading ProblemManagement Science, 1971
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961
- Discrete-Variable Extremum ProblemsOperations Research, 1957
- The dissection of rectangles into squaresDuke Mathematical Journal, 1940