Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results

References

• Barnhart C., Johnson E. L., Nemhauser L. E., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Operations Research (1998) 43:316–329Link, Google Scholar
• Beasley J. E. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society (1990) 41:1069–1072Crossref, Google Scholar
• Caprara A., Fischetti M., Toth P. A heuristic method for the set covering problem. Operations Research (1999) 47:730–743Link, Google Scholar
• Chvátal V.Linear Programming (1983) (W. H. Freeman and Co., New York) Google Scholar
• Degraeve Z. Scheduling joint product operations with proposal generation methods. (1992) . Ph.D. dissertation, The University of Chicago, Graduate School of Business, Chicago, ILGoogle Scholar
• Degraeve Z., Schrage L. Should we use a portable generator in an emergency? (1997) . Research Report, Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Leuven, BelgiumGoogle Scholar
• Degraeve Z., Schrage L. Optimal integer solutions to industrial cutting stock problems. INFORMS Journal on Computing (1999) 11:406–419Link, Google Scholar
• Farley A. A. A note on bounding a class of linear programming problems, including cutting stock problems. Operation Research (1990) 38:922–923Link, Google Scholar
• Gau T., Wäscher G. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research (1995) 84:572–579Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem. Operation Research (1961) 9:849–859Link, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem-Part II. Operations Research (1963) 11:863–888Link, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, U.K) Google Scholar
• Martin R. K.Large Scale Linear and Integer Optimization (1999) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Nitsche C., Scheithauer G., Terno J. Tighter relaxations for the cutting stock problem. European Journal of Operational Research (1999) 112:654–663Crossref, Google Scholar
• Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research (1997) 45:831–841Link, Google Scholar
• Scheithauer G., Terno J. A branch-and-bound algorithm for solving one-dimensional cutting stock problem exactly. Applicationes Mathematicae (1995) 23:151–167Google Scholar
• Scholl A., Klein R., Jürgens C. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research (1997) 24:627–645Crossref, Google Scholar
• Schrage L. LINDO: Optimization Software for Linear Programming. (1995) (Lindo Systems Inc., Chicago, IL) Google Scholar
• Valério De Carvalho J. M. Exact solutions of cutting stock problems using column generation and branch-and-bound. International Transactions in Operational Research (1998) 5:35–44Crossref, Google Scholar
• Vance P. H. Branch-and-price algorithms for the onedimensional cutting stock problem. Computational Optimization and Applications (1998) 9:212–228Crossref, Google Scholar
• Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Solving binary cutting stock problems by column generation and branch and bound. Computational Optimization and Applications (1996) 3:111–130Crossref, Google Scholar
• Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming Ser. A (1999) 86:565–594Crossref, Google Scholar
• Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. Operations Research Letters (1996) 19:151–159Crossref, Google Scholar
• Wäscher G., Gau T. Heuristics for the integer onedimensional cutting stock problem: A computational study. OR Spektrum (1996) 18:131–144Crossref, Google Scholar
• Wolsey L. A.Intger Programming (1998) (Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, U.K) Google Scholar