Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem

Published Online:https://doi.org/10.1287/ijoc.1070.0233

References

  • Alvarez-Valdés R., Parajón A., Tamarit J. M. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. (2002) 29:925–947CrossrefGoogle Scholar
  • Alvarez-Valdés R., Martì R., Parajón A., Tamarit J. M. GRASP and path relinking for the two-dimensional two-staged cutting stock problem. INFORMS J. Comput. (2007) 19:261–272LinkGoogle Scholar
  • Beasley J. E. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1985) 36:297–306CrossrefGoogle Scholar
  • Belov G., Scheithauer G. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. (2006) 171:85–106CrossrefGoogle Scholar
  • Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159CrossrefGoogle Scholar
  • Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem. Oper. Res. (1961) 9:849–859LinkGoogle Scholar
  • Gilmore P. C., Gomory R. E. Multistage cutting problems of two and more dimensions. Oper. Res. (1965) 13:94–119LinkGoogle Scholar
  • Hifi M. Exact algorithms for large-scale unconstrained two and three staged cutting problems. Comput. Optim. Appl. (2001) 18:63–88CrossrefGoogle Scholar
  • Hifi M., M'Hallah R. An exact algorithm for constrained two-dimensional two-staged cutting problems. Oper. Res. (2005) 53:140–150LinkGoogle Scholar
  • Hifi M., M'Hallah R. Strip generation algorithms for two-staged two-dimensional cutting stock problems. Eur. J. Oper. Res. (2006) 172:515–527CrossrefGoogle Scholar
  • Hifi M., Roucairol C. Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems. J. Combin. Optim. (2001) 5:465–494CrossrefGoogle Scholar
  • Lodi A., Monaci M. Integer linear programming models for 2-staged two-dimensional knapsack problems. Math. Programming (2003) 94:257–278CrossrefGoogle Scholar
  • Morabito R., Arenales M. Staged and constrained two-dimensional guillotine cutting problems: An and/or-graph approach. Eur. J. Oper. Res. (1996) 94:548–560CrossrefGoogle Scholar
  • Morabito R., Garcia V. The cutting stock problem in hardboard industry: A case study. Comput. Oper. Res. (1998) 25:469–485CrossrefGoogle Scholar
  • Ow P. S., Morton T. E. Filtered beam search in scheduling. Internat. J. Production Res. (1988) 26:297–307CrossrefGoogle Scholar
  • Sweeney P., Paternoster E. Cutting and packing problems: A categorized application-oriented research bibliography. J. Oper. Res. Soc. (1992) 43:691–706CrossrefGoogle Scholar
  • Wäscher G., Haussner H., Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183:1109–1130CrossrefGoogle 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.