Technical Note on “Optimal Integer Solutions to Industrial Cutting Stock Problems” by Degraeve and Schrage

References

  • De Carvalho J. M. V. Exact solution of cutting stock problems using column generation and branch-and-bound. International Transactions Operational Research (1998) 5:35–44CrossrefGoogle Scholar
  • Degraeve Z., Schrage L. Optimal integer solutions to industrial cutting stock problems. INFORMS J. Computing (1999) 11:406–419LinkGoogle Scholar
  • Goulimis C. N.Optimal solutions to the cutting stock problem (1990a) (Imperial College, London University, London) . Ph.D. ThesisCrossrefGoogle Scholar
  • Goulimis C. N. Optimal solutions to the cutting stock problem. European J. Operational Research (1990b) 44:197–208CrossrefGoogle Scholar
  • Vanderbeck F.On integer programming decomposition and ways to enforce integrality in the master (1996) (Judge Institute of Management Studies, Cambridge University, Cambridge) Google Scholar
  • Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming (1999) 86(Ser. A):565–594CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.