Comparison of Bundle and Classical Column

@inproceedings{LemarchalComparisonOB,
  title={Comparison of Bundle and Classical Column},
  author={Claude Lemar{\'e}chal and François Vanderbeck}
}
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