Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm

Journal of the Operational Research Society

Volumn 52, Issue 12, 2001, Pages 1390-1401

  Scheithauer, G ^a   Terno, J ^a   Muller A ^a   Belov, G ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Column generation; Cutting planes; Cutting stock problem; Integer programming; Linear programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPERATIONS RESEARCH; SET THEORY; THEOREM PROVING;

COLUMN GENERATION; CUTTING PLANE ALGORITHM; ONE DIMENSIONAL CUTTING STOCK PROBLEMS;

LINEAR PROGRAMMING;

EID: 0035576826     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601242     Document Type: Article

References (20)

1. Gilmore PC and Gomory RE (1961). A linear programming approach to the cutting-stock problem (Part I). Opns Res 9: 849-859.
2. Martello S and Toth P (1990). Knapsack Problems-Algorithms and Computer Implementations. John Wiley & Sons: Chichester.
3. Scheithauer G and Terno J (1995). A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly. Appl Math 23: 151-167.
4. Vance P (1998). Branch-and-price algorithms for the onedimensional cutting stock problem. Comput Optim Appl 9: 212-228.
5. Vanderbeck F (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems. Math Program 86A: 565-594.
6. Kupke J (1998). Ltisung von ganzzahligen Verschnittproblemen mit Branch-and-Price. Diplomarbeit, Universitat zu Ktiln.
7. Belov G and Scheithauer G (2001). Solving the general onedimensional cutting stock problem with a cutting plane approach. Eur J Opl Res (to appear).
8. Wscher G and Gau T (1996). Heuristics for the onedimensional cutting stock problem: a computational study. OR Spectrum 18: 131-144.
9. Nitsche C, Scheithauer G and Terno J (1999). Tighter relaxations for the cutting stock problem. Eur J Opl Res 112: 654-663.
10. Scheithauer G and Terno J (1997). Facet-defining inequalities for the cutting stock problem. Perquisa Operacional 19: 131-144.
11. Baum S and Trotter LE Jr (1981). Integer rounding for poly-matroid and branching optimization problems. SIAM J Algeb Disc Meth 2: 416-425.
12. Scheithauer G and Terno J (1995). The modified integer roundup property of the one-dimensional cutting stock problem. Eur J Opl Res 84: 562-571.
13. Scheithauer G and Terno J (1997). Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Opns Res Lett 20: 93-100.
14. Marcotte O (1986). An instance of the cutting stock problem for which the rounding property does not hold. OR Lett 4: 239-243.
15. Nemhauser GL and Wolsey LA (1988). Integer and Combinatorial Optimization. John Wiley & Sons: New York.
16. Mukhacheva EA, Belov GN, Kartak OM and Mukhacheva AS (2000). One-dimensional cutting stock problem: numerical experiments with the sequential value correction method. Pesquisa Operacional 20: 153-168.
17. Schwerin P and Wscher G (1999). A new lower bound for the bin-packing problem and its integration to MTP. Pesquisa Operacional 19: 111-130.
18. Scheithauer G, Terno J, Muller A and Belov G (1999). Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. Technical Report MATH-NM-06-1999, Dresden University of Technology.
19. Rietz J, Scheithauer G and Terno J (1998). Families of non-IRUP instances of the one-dimensional cutting stock problem. Technical Report MATH-NM-09-1998, Dresden University of Technology.
20. Kolen AWJ and Spieksma FCR (2000). Solving a bi-criterion cutting stock problem with open-ended demand: a case study. JOpl Res Soc 51: 1238-1247.