Using Extra Dual Cuts to Accelerate Column Generation

References

• Beasley J. E. OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. (1990) 41:1069–1072Crossref, Google Scholar
• 1998CPLEX 6.0Google Scholar
• Dantzig G. B., Wolfe P. Decomposition principle for linear programs. Oper. Res. (1960) 8:101–111Link, Google Scholar
• du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilized column generation. Disc. Math. (1999) 194:229–237Crossref, Google Scholar
• Farley A. A. A note on bounding a class of linear programming problems, including cutting stock problems. Oper. Res. (1990) 38:992–993Link, 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
• Hu J., Johnson E. L. Computational results with a primal-dual subproblem simplex method. Oper. Res. Lett. (1999) 25:149–157Crossref, Google Scholar
• Lasdon L.Optimization Theory for Large Systems (1970) (Macmillan Series in Operations Research, London, UK) Google Scholar
• Marsten R. M., Hogan W., Blankenship J. The boxstep method for large-scale optimization. Oper. Res. (1975) 23:389–405Link, Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley, New York) Google Scholar
• Vance P. Crew scheduling, cutting stock and column generation: Solving huge integer programs. (1993) . Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar