Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
Published Online:4 Jan 2008https://doi.org/10.1287/ijoc.1070.0233
References
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. (2002) 29:925–947Crossref, Google Scholar
- GRASP and path relinking for the two-dimensional two-staged cutting stock problem. INFORMS J. Comput. (2007) 19:261–272Link, Google Scholar
- Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1985) 36:297–306Crossref, Google Scholar
- 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–106Crossref, Google Scholar
- A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159Crossref, Google Scholar
- A linear programming approach to the cutting stock problem. Oper. Res. (1961) 9:849–859Link, Google Scholar
- Multistage cutting problems of two and more dimensions. Oper. Res. (1965) 13:94–119Link, Google Scholar
- Exact algorithms for large-scale unconstrained two and three staged cutting problems. Comput. Optim. Appl. (2001) 18:63–88Crossref, Google Scholar
- An exact algorithm for constrained two-dimensional two-staged cutting problems. Oper. Res. (2005) 53:140–150Link, Google Scholar
- Strip generation algorithms for two-staged two-dimensional cutting stock problems. Eur. J. Oper. Res. (2006) 172:515–527Crossref, Google Scholar
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems. J. Combin. Optim. (2001) 5:465–494Crossref, Google Scholar
- Integer linear programming models for 2-staged two-dimensional knapsack problems. Math. Programming (2003) 94:257–278Crossref, Google Scholar
- Staged and constrained two-dimensional guillotine cutting problems: An and/or-graph approach. Eur. J. Oper. Res. (1996) 94:548–560Crossref, Google Scholar
- The cutting stock problem in hardboard industry: A case study. Comput. Oper. Res. (1998) 25:469–485Crossref, Google Scholar
- Filtered beam search in scheduling. Internat. J. Production Res. (1988) 26:297–307Crossref, Google Scholar
- Cutting and packing problems: A categorized application-oriented research bibliography. J. Oper. Res. Soc. (1992) 43:691–706Crossref, Google Scholar
- An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183:1109–1130Crossref, Google Scholar

