A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

References

  • Beasley J.E. An algorithm for the two-dimensional assortment problem. Eur. J. Oper. Res. (1985) 19:253–261CrossrefGoogle Scholar
  • Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem. Oper. Res. (196l) 9:849–859LinkGoogle Scholar
  • Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem: Part II. Oper. Res. (1963) 11:863–888LinkGoogle Scholar
  • Gilmore P.C., Gomory R.E. Multistage cutting stock problems of two and more dimensions. Oper. Res. (1965) 13:94–120LinkGoogle Scholar
  • Gilmore P.C., Gomory R.E. The theory and computation of knapsack functions. Oper. Res. (1966) 14:1045–1074LinkGoogle Scholar
  • Johnson E.L., Padberg M.W. A note on the knapsack problem with special ordered sets. Oper. Res. Lett. (1981) 1(1):18–22CrossrefGoogle Scholar
  • Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley)Wiley Interscience Series in Discrete Mathematics and OptimizationGoogle Scholar
  • Pisinger D. Core problems in knapsack algorithms. Oper. Res. (1999) 47(4):570–575LinkGoogle Scholar
  • Riehme J., Scheithauer G., Terno J. The solution of two-stage guillotine stock problems having extremely varying demands. Eur. J. Oper. Res. (1996) 91:543–552CrossrefGoogle Scholar
  • Valerio De Carvalho J.M., Guimaraes Rodriges A.J. A computer based interactive approach to a two-stage cutting stock problem. INFOR (1994) 32(4):243–252Google Scholar
  • Valerio De Carvalho J.M., Guimaraes Rodriges A.J. A LP-based approach to a two-stage cutting stock problem. Eur. J. Oper. Res. (1995) 84:580–589CrossrefGoogle Scholar
  • Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Programming (1999) 86:565–594Ser.ACrossrefGoogle Scholar
  • Vanderbeck F., Wolsey L.A. An exact algorithm for IP column generation. Oper. Res. Lett. (1996) 19(4):151–159CrossrefGoogle Scholar
  • Weismantel R. Hilbert bases and the facets of special knapsack polytopes. Math. Oper. Res. (1996) 21(4):886–904LinkGoogle Scholar
  • Xpress-MPUser Guide and Reference Manual, Release 10 (1997) . Dash Associates http://www.dash.co.ukGoogle 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.