A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1315-1328

  Alves, Cláudio ^a   Valerio de Carvalho J M ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Branch and price and cut; Column generation; Multiple length cutting stock; Stabilization of column generation

Indexed keywords

COST REDUCTION; INVENTORY CONTROL; LINEAR PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES;

BRANCH-AND-PRICE-AND-CUTS; COLUMN GENERATION; MULTIPLE LENGTH CUTTING STOCKS;

HEURISTIC ALGORITHMS;

EID: 34548604979     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.08.014     Document Type: Article

References (23)

1. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem: Part II. Operations Research 11 (1963) 863-888
2. Roodman G. Near optimal solutions to one-dimensional cutting stock problem. Computers and Operations Research 13 (1986) 713-719
3. Holthaus O. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. European Journal of Operational Research 141 (2002) 295-312
4. Gradisar M., Jesenko J., and Resinovic G. Optimization of roll cutting in clothing industry. Computers and Operations Research 24 (1997) 945-953
5. Gradisar M., Kljajic M., Resinovic G., and Jesenko J. A sequential heuristic procedure for one-dimensional cutting. European Journal of Operational Research 114 (1999) 557-568
6. Friesen D., and Langston M. Variable sized bin packing. SIAM Journal on Computing 15 (1986) 222-230
7. Murgolo F. An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing 16 (1987) 149-161
8. Chu C., and La R. Variable-sized bin packing: Tight absolute worst case performance ratios for four approximation algorithms. SIAM Journal on Computing 30 6 (2001) 2069-2083
9. Kang J., and Park S. Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147 (2003) 365-372
10. Coffman E.G., Garey M.R., and Johnson D.S. Bin packing with divisible item sizes. Journal of Complexity 3 (1987) 406-428
11. Monaci M. Algorithms for packing and scheduling problems. Ph.D. Thesis, Università di Bologna, 2002.
12. Martello S., and Toth P. Knapsack problems (1990), Wiley, New York
13. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141 (2002) 274-294
14. Valério de Carvalho J.M. Using extra dual cuts to accelerate convergence in column generation. INFORMS Journal on Computing 17 2 (2005) 175-182
15. Alves C. Cutting and packing: problems, models and exact algorithms, Ph.D. Thesis, University of Minho; February 2005.
16. Ben Amor H., Desrosiers J., and Valério de Carvalho J.M. Dual-optimal inequalities for stabilized column generation. Operations Research 54 3 (2006) 454-463
17. Goulimis C. Optimal solutions for the cutting stock problem. European Journal of Operational Research 44 (1990) 197-208
18. Kantorovich L.V. Mathematical models of organising and planning production. Management Science 6 (1960) 366-422 translated from the Russian original, 1939
19. Valério de Carvalho J.M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86 (1999) 629-659
20. Valério de Carvalho J.M. LP models for bin-packing and cutting stock problems. European Journal of Operational Research 141 2 (2002) 253-273
21. Vanderbeck F. Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Operations Research 48 6 (2000) 915-926
22. Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86 3 (1999) 565-594
23. ILOG. CPLEX 8.0 User's Manual. 2002.