GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem

References

• Alvarez-Valdes R., Parajon A., Tamarit J. M. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. (2002) 29:925–947Crossref, Google Scholar
• Beasley J. E. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1985) 36:297–306Crossref, Google Scholar
• Belov G., Scheithauer G. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. (2003) . Technical Report MATH-NM-03, Institute of Numerical Mathematics, Dresden University, Dresden, GermanyGoogle Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159Crossref, Google Scholar
• Festa P., Resende M. G. C., Resende M. G. C., Hansen P. GRASP: An annotated bibliography. Essays and Surveys in Metaheuristics (2001) (Kluwer Academic Publishers, Boston, MA) 325–367Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem. Oper. Res. (1961) 9:849–859Link, Google Scholar
• Gilmore P. C., Gomory R. E. Multistage cutting problems of two and more dimensions. Oper. Res. (1965) 13:94–119Link, Google Scholar
• Glover F. Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. (1994) 49:231–255Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Hifi M. Exact algorithms for large-scale unconstrained two and three staged cutting problems. Comput. Optim. Appl. (2001) 18:63–88Crossref, Google Scholar
• Hifi M., M’Hallah R. Strip generation algorithms for constrained two-dimensional two-staged cutting problems. Eur. J. Oper. Res. (2006) 172:515–527Crossref, Google 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–494Crossref, Google Scholar
• Laguna M., Martí R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. (1999) 11:44–52Link, Google Scholar
• Laguna M., Martí R.Scatter Search—Methodology and Implementations in C (2003) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Lodi A., Monaci M. Integer linear programming models for 2-staged two-dimensional knapsack problems. Math. Programming Ser. B (2003) 94:257–278Crossref, Google Scholar
• Martello S., Toth P.Knapsack Problems. Algorithms and Computer Implementations (1990) (Wiley, Chichester, UK) Google Scholar
• Morabito R., Garcia V. The cutting stock problem in the hardboard industry: A case study. Comput. Oper. Res. (1998) 25:469–485Crossref, Google Scholar
• Resende M. G. C., Ribeiro C. C., Glover F., Kochenberger G. Greedy randomized adaptive search procedures. State-of-the-Art Handbook in Metaheuristics (2001) (Kluwer Academic Publishers, Boston, MA) 219–250Crossref, Google Scholar
• Sweeney P. E., Paternoster E. R. Cutting and packing problems: A categorized applications-oriented research bibliography. J. Oper. Res. Soc. (1992) 43:691–706Crossref, Google Scholar
• Wang P. Y., Valenzuela C. L. Data set generation for rectangular placement problems. Eur. J. Oper. Res. (2001) 134:378–391Crossref, Google Scholar