Optimal Integer Solutions to Industrial Cutting Stock Problems

References

• Bartholdi J. J. A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper. Res. (1981) 29 501 510 Link, Google Scholar
• Degraeve Z. Scheduling joint product operations with proposal generation methods. (1992) (The University of Chicago, Graduate School of Business, Chicago, IL) . Ph.D. dissertation Google Scholar
• Degraeve Z. , Schrage L. Should I use a portable problem generator in an emergency. (1997) . Research report 9723, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium Google Scholar
• Dyckhoff H. A new linear programming approach to the cutting stock problem. Oper. Res. (1981) 29 1092 1104 Link, Google Scholar
• Farley A. A. A note on bounding a class of linear programming problems including cutting stock problems. Oper. Res. (1990) 38 922 923 Link, Google Scholar
• Gau T. , Wäscher G. Cutgen1: A problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. (1995) 84 572 579 Crossref, Google Scholar
• Gilmore P. C. , Gomory R. E. A linear programming approach to the cutting stock problem. Oper. Res. (1961) 9 849 859 Link, Google Scholar
• Gilmore P. C. , Gomory R. E. A linear programming approach to the cutting stock problem—Part II. Oper. Res. (1963) 11 863 888 Link, Google Scholar
• Marcotte O. The cutting stock problem and integer rounding. Math. Programming (1985) 33 82 92 Crossref, Google Scholar
• Marcotte O. An instance of the cutting stock problem for which the rounding property does not hold. Oper. Res. Lett. (1986) 4 239 243 Crossref, Google Scholar
• Schrage L. LINDO: Optimization software for linear programming. (1995) (Lindo Systems Inc., Chicago, IL) Google Scholar
• Vance P. H. , Barnhart C. , Johnson E. L. , Nemhauser G. L. Solving binary cutting stock problems by column generation and branch and bound. Comput. Optim. Appl. (1994) 3 111 130 Crossref, Google Scholar
• Vance P. H. Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. (1998) 9 212 228 Crossref, Google Scholar
• Wäscher G. Two approaches to the cutting stock problem. Paper presented at the IFORS '93 conference. (1993) Lisbon Google Scholar
• Wäscher G. , Gau T. Generating almost optimal solutions for the integer one-dimensional cutting stock problem. (1994) . Working paper no. 94/06, Technische Universität Braunschweig, Institut für Wirtschaftswissenschaften, Braunschweig, Germany Google Scholar