A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- 1 April 2012
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 218 (1), 251-260
- https://doi.org/10.1016/j.ejor.2011.10.018
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Decomposition and reformulation of integer linear programming problems4OR, 2011
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generationEuropean Journal of Operational Research, 2008
- The Vertex Coloring Problem and its generalizations4OR, 2008
- Integer linear programming models for 2-staged two-dimensional Knapsack problemsMathematical Programming, 2003
- Two-dimensional packing problems: A surveyEuropean Journal of Operational Research, 2002
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problemsOR Spectrum, 2002
- The solution of two-stage guillotine cutting stock problems having extremely varying order demandsEuropean Journal of Operational Research, 1996
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961