An algorithm for the two-dimensional assortment problem
- 1 February 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 19 (2) , 253-261
- https://doi.org/10.1016/0377-2217(85)90179-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Two Algorithms for Constrained Two-Dimensional Cutting Stock ProblemsOperations Research, 1983
- A New Linear Programming Approach to the Cutting Stock ProblemOperations Research, 1981
- The trim-loss and assortment problems: A surveyEuropean Journal of Operational Research, 1980
- The Cutting Stock Problem in the Flat Glass Industry -- Selection of Stock SizesJournal of the Operational Research Society, 1976
- A Note on a Two-dimensional Dynamic Programming ProblemJournal of the Operational Research Society, 1975
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963