Comparison of bundle and classical column generation

  title={Comparison of bundle and classical column generation},
  author={Olivier Briant and Claude Lemar{\'e}chal and Philippe Meurdesoif and S. Michel and Nancy Perrot and François Vanderbeck},
  journal={Math. Program.},
the date of receipt and acceptance should be inserted later Abstract. When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However , more stable methods with better theoretical convergence rates are known and have… CONTINUE READING