A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
Published Online:1 Jun 2001https://doi.org/10.1287/mnsc.47.6.864.9809
References
- An algorithm for the two-dimensional assortment problem. Eur. J. Oper. Res. (1985) 19:253–261Crossref, Google Scholar
- A linear programming approach to the cutting stock problem. Oper. Res. (196l) 9:849–859Link, Google Scholar
- A linear programming approach to the cutting stock problem: Part II. Oper. Res. (1963) 11:863–888Link, Google Scholar
- Multistage cutting stock problems of two and more dimensions. Oper. Res. (1965) 13:94–120Link, Google Scholar
- The theory and computation of knapsack functions. Oper. Res. (1966) 14:1045–1074Link, Google Scholar
- A note on the knapsack problem with special ordered sets. Oper. Res. Lett. (1981) 1(1):18–22Crossref, Google Scholar
- Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley)Wiley Interscience Series in Discrete Mathematics and OptimizationGoogle Scholar
- Core problems in knapsack algorithms. Oper. Res. (1999) 47(4):570–575Link, Google Scholar
- The solution of two-stage guillotine stock problems having extremely varying demands. Eur. J. Oper. Res. (1996) 91:543–552Crossref, Google Scholar
- A computer based interactive approach to a two-stage cutting stock problem. INFOR (1994) 32(4):243–252Google Scholar
- A LP-based approach to a two-stage cutting stock problem. Eur. J. Oper. Res. (1995) 84:580–589Crossref, Google Scholar
- Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming (1999) 86:565–594Ser.ACrossref, Google Scholar
- An exact algorithm for IP column generation. Oper. Res. Lett. (1996) 19(4):151–159Crossref, Google Scholar
- Hilbert bases and the facets of special knapsack polytopes. Math. Oper. Res. (1996) 21(4):886–904Link, Google Scholar
- Xpress-MPUser Guide and Reference Manual, Release 10 (1997) . Dash Associates http://www.dash.co.ukGoogle Scholar

