Technical Note on “Optimal Integer Solutions to Industrial Cutting Stock Problems” by Degraeve and Schrage
Published Online:1 Nov 2001https://doi.org/10.1287/ijoc.13.4.360.9738
References
- Exact solution of cutting stock problems using column generation and branch-and-bound. International Transactions Operational Research (1998) 5:35–44Crossref, Google Scholar
- Optimal integer solutions to industrial cutting stock problems. INFORMS J. Computing (1999) 11:406–419Link, Google Scholar
- Optimal solutions to the cutting stock problem (1990a) (Imperial College, London University, London) . Ph.D. ThesisCrossref, Google Scholar
- Optimal solutions to the cutting stock problem. European J. Operational Research (1990b) 44:197–208Crossref, Google Scholar
- On integer programming decomposition and ways to enforce integrality in the master (1996) (Judge Institute of Management Studies, Cambridge University, Cambridge) Google Scholar
- Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming (1999) 86(Ser. A):565–594Crossref, Google Scholar

