A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- 1 April 2008
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (4) , 1315-1328
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Algorithms for the variable sized bin packing problemEuropean Journal of Operational Research, 2003
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengthsEuropean Journal of Operational Research, 2002
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation AlgorithmsSIAM Journal on Computing, 2001
- A sequential heuristic procedure for one-dimensional cuttingEuropean Journal of Operational Research, 1999
- Optimization of roll cutting in clothing industryComputers & Operations Research, 1997
- Bin packing with divisible item sizesJournal of Complexity, 1987
- An Efficient Approximation Scheme for Variable-Sized Bin PackingSIAM Journal on Computing, 1987
- Variable Sized Bin PackingSIAM Journal on Computing, 1986
- Near-optimal solutions to one-dimensional cutting stock problemsComputers & Operations Research, 1986
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963