Solution approaches for the cutting stock problem with setup cost
- 31 January 2013
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 40 (1), 225-235
- https://doi.org/10.1016/j.cor.2012.06.007
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reductionOptimization Methods and Software, 2011
- A branch-and-price-and-cut algorithm for the pattern minimization problemRAIRO - Operations Research, 2008
- A heuristic for the one-dimensional cutting stock problem with pattern reductionProceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2008
- Setup and Open-Stacks Minimization in One-Dimensional Stock CuttingINFORMS Journal on Computing, 2007
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengthsEuropean Journal of Operational Research, 2002
- Optimization of Wafer Exposure Patterns Using a Two-Dimensional Cutting AlgorithmInternational Transactions in Operational Research, 2001
- Setup minimising conditions in the trim loss problemEuropean Journal of Operational Research, 1996
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990
- Trim loss and related problemsOmega, 1985
- Fixed charge problems with identical fixed chargesEuropean Journal of Operational Research, 1984