A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

European Journal of Operational Research

Volumn 171, Issue 1, 2006, Pages 85-106

  Belov, G ^a   Scheithauer, G ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Branch and bound; Column generation; Cutting; Cutting planes

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BRANCH-AND-BOUND; COLUMN GENERATION; CUTTING PLANES;

ALGORITHMS;

EID: 28044443917     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.08.036     Document Type: Article

References (38)

1. J.T. Linderoth, and M.W.P. Savelsbergh A computational study of strategies for mixed integer programming INFORMS Journal on Computing 11 1999 173 187
2. A. Martin General mixed-integer programming: computational issues for branch-and-cut algorithms M. Jünger D. Naddef Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions Lecture Notes in Computer Science vol. 2241 2001 Springer-Verlag Heidelberg 1 25
3. E. Balas, and M. Perregaard Lift-and-project for mixed 0-1 programming: Recent progress Discrete Applied Mathematics 123 1-3 2002 129 154
4. ILOG, ILOG optimization suite. Delivering a competitive advantage, White paper, ILOG Corporation. Available from: , 2001.
5. M. Jünger, and S. Thienel The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization Software: Practice and Experience 30 11 2000 1325 1352
6. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting-stock problem Operations Research 9 1961 849 859
7. P.H. Vance, C. Barnhart, E.L. Johnson, and G. Nemhauser Solving binary cutting stock problems by column generation and branch-and-bound Computational Optimization and Applications 3 1994 111 130
8. F. Vanderbeck Computational study of a column generation algorithm for bin packing and cutting stock problems Mathematical Programming Series A 86 3 1999 565 594
9. J.M.V. de Carvalho LP models for bin-packing and cutting stock problems European Journal of Operational Research 141 2 2002 253 273
10. J. Kupke, Lösung von ganzzahligen Verschnittproblemen mit Branch-and-Price, Diplomarbeit, Universität zu Köln, 1998.
11. Z. Degraeve, and M. Peeters Optimal integer solutions to industrial cutting stock problems: Part 2, benchmark results INFORMS Journal on Computing 15 2003 58 81
12. M. Peeters, One-dimensional cutting and packing: new problems and algorithms, Ph.D. thesis, Katholieke Universiteit Leuven, Belgium, 2002.
13. L.A. Wolsey Integer Programming, Wiley Interscience Series in Discrete Mathematics and Optimization 1998 John Wiley Chichester
14. F. Vanderbeck Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem Operations Research 48 6 2000 915 926
15. C. Barnhart, C.A. Hane, and P.H. Vance Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems Operations Research 48 2000 318 326
16. G. Scheithauer, J. Terno, A. Müller, and G. Belov Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm Journal of the Operational Research Society 52 2001 1390 1401
17. G. Belov, and G. Scheithauer A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths European Journal of Operational Research 141 2 2002 274 294
18. G. Belov, G. Scheithauer, Setup and open stacks minimization in one-dimensional stock cutting, Technical Report, Dresden University, 2003, to appear in INFORMS Journal on Computing.
19. R.E. Johnston, and E. Sadinlija A new model for complete solutions to one-dimensional stock problems European Journal of Operational Research 153 2004 176 183
20. J.E. Schoenfield Fast, exact solution of open bin packing problems without linear programming, draft, US Army Space & Missile Defense Command 2002 Huntsville AL, USA
21. S. Martello, and P. Toth Knapsack Problems-Algorithms and Computer Implementations 1990 John Wiley Chichester
22. C. Nitsche, G. Scheithauer, and J. Terno Tighter relaxations for the cutting stock problem European Journal of Operational Research 112 1999 654 663
23. G. Scheithauer, and J. Terno The modified integer round-up property of the one-dimensional cutting stock problem European Journal of Operational Research 84 1995 562 571
24. J. Rietz, Investigations of MIRUP for vector packing problems, Ph.D. thesis, Freiberg University, 2003 (in German).
25. P.C. Gilmore, and R.E. Gomory Multistage cutting stock problems of two and more dimensions Operations Research 13 1965 94 120
26. M. Hifi, and C. Roucairol Approximate and exact algorithm for constrained (un)weighted two-dimensional two-staged cutting stock problems Journal of Combinatorial Optimization 5 2001 465 494
27. A. Lodi, and M. Monaci Integer linear programming models for 2-staged two-dimensional knapsack problems Mathematical Programming Series B 94 2002 257 278
28. M. Hifi, R. M'Hallah, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, Working Paper, Serie Bleu, Universite de Paris 1, 2003.
29. G. Belov, G. Scheithauer, Variable width models for two-dimensional two-stage cutting, Technical Report, Dresden University, 2003.
30. G. Belov, G. Scheithauer, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Technical Report, Dresden University. Available from: , 2003.
31. C. Cordier, H. Marchand, R. Laundy, and L.A. Wolsey BC-OPT: A branch-and-cut code for mixed integer programs Mathematical Programming 86 2 1999 335 354
32. C. Alves, J.M.V. de Carvalho, A branch-and-price algorithm for integer variable sized bin-packing problems, Technical Report, Universidade do Minho, Portugal, 2003.
33. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 John Wiley New York
34. A.N. Letchford, and A. Lodi Strengthening Chvátal-Gomory cuts and Gomory fractional cuts Operations Research Letters 30 2 2002 74 82
35. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting-stock problem (Part II) Operations Research 11 1963 863 887
36. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack Problems 2004 Springer-Verlag
37. E. Falkenauer A hybrid grouping genetic algorithm for bin packing Journal of Heuristics 2 1 1996 5 30
38. G. Wäscher, and T. Gau Heuristics for the one-dimensional cutting stock problem: A computational study OR Spektrum 18 1996 131 144