Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems

References

• Cheng C. H., Feiring B. R., Cheng T. C. E. The cutting stock problem—A survey. Internat. J. Production Econom. (1994) 36:291–305Crossref, Google Scholar
• Chu C., La R. Bin packing with different lengths: Heuristics and worst case performance analysis. SIAM J. Comput. (1999) . SubmittedGoogle Scholar
• Coffmann E. G., Garey M. R., Johnson D. S. Approximation algorithms for bin packing: An updated survey. SIAM J. Comput. (1983) 12(2):227–258Crossref, Google Scholar
• Coffmann E. G., Halfin S., Jean-Marie A., Robert P. Stochastic analysis of a slotted FIFO communication channel. IEEE Trans. Inform. Theory (1993) 39:1555–1566Crossref, Google Scholar
• Costa M. C. Une étude pratique de découpe de panneaux de bois. RAIRO Rech. opérationnelle. Oper. Res. (1982) 18:211–219Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Garey M. R., Johnson D. S., Ausiello G., Lucertini M. Approximation algorithms for bin packing problems: A survey. Analysis and Design of Algorithms in Combinatorial Optimization (1981) (Springer-Verlag, Vienna, Austria) . No. 266 in CISM Courses and LecturesCrossref, 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. A linear programming approach to the cutting stock problem—Part II. Oper. Res. (1963) 11:863–888Link, Google Scholar
• Gilmore P. C., Gomory R. E. Multi-stage cutting stock problems of two and more dimensions. Oper. Res. (1965) 13:94–120Link, Google Scholar
• Goulimis C. Optimal solutions for the cutting stock problem. Eur. J. Oper. Res. (1990) 44:197–208Crossref, Google Scholar
• Johnson D. S. Fast algorithms for bin packing. J. Comput. Systems Sci. (1974) 8:272–315Crossref, Google Scholar
• Labbé M., Laporte G., Mercure H. Capacitated vehicle routing on trees. Oper. Res. (1991) 39:616–622Link, Google Scholar
• Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. (1990) 28:59–70Crossref, Google Scholar