Optimal solutions for the cutting stock problem
- 25 January 1990
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 44 (2), 197-208
- https://doi.org/10.1016/0377-2217(90)90355-f
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The cutting stock problem and integer roundingMathematical Programming, 1985
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1982
- A New Linear Programming Approach to the Cutting Stock ProblemOperations Research, 1981
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- The trim-loss and assortment problems: A surveyEuropean Journal of Operational Research, 1980
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- A Heuristic Programming Solution to a Nonlinear Cutting Stock ProblemManagement Science, 1971
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961