An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

References

• Beasley J. E. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1985) 36:297–306Crossref, Google Scholar
• Dyckhoff H. A typology of cutting and packing problems. Eur. J. Oper. Res. (1990) 44:145–159Crossref, Google Scholar
• Dyckhoff H., Scheithauer G., Terno J., Dell'Amico M., Maffioli F., Martello S. Cutting and packing (C&P). Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley and Sons, Chichester, U.K) Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco, CA) Google 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
• Hifi M. Contribution à la résolution de quelques problèmes difficiles de l'optimisation combinatoire. (1999) . [A contribution to the solution of some difficult problems of combinatorial optimization] Habilitation thesis, PRiSM, Université de Versailles, Saint-Quentin-en-Yvelines, FranceGoogle 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 stock problems. (2001) . Technical report 2001-Cahiers Bleu, Maison des Sciences Economiques, Université Paris 1 Panthéon-Sorbonne, FranceGoogle 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
• Kantorovich L. V. Mathematical methods of organizing and planning production. Management Sci. (1960) 6:363–422Link, Google Scholar
• Lodi A., Monaci M. Integer linear programming models for 2-staged two-dimensional knapsack problems. Math. Programming (2003) 94:257–278Crossref, Google Scholar
• Martello S., Toth P. An exact algorithm for large unbounded knapsack problems. Oper. Res. Lett. (1990) 9:15–20Crossref, Google Scholar
• Martello S., Toth P. Upper bounds and algorithms for hard 0–1 knapsack problems. Oper. Res. (1997) 45:768–778Link, Google Scholar
• Morabito R., Arenales M. Staged and constrained two-dimensional guillotine cutting problems: An and-or-graph approach. Eur. J. Oper. Res. (1996) 94/3:548–560Crossref, Google Scholar
• Morabito R., Garcia V. The cutting stock problem in hardboard industry: A case study. Comput. Oper. Res. (1998) 25:469–485Crossref, Google Scholar
• Pisinger D. A minimal algorithm for the 0–1 knapsack problem. Oper. Res. (1997) 45:758–767Link, Google Scholar
• Vanderbeck F. A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem. Management Sci. (2001) 47:864–879Link, Google Scholar