Comparison of Bundle and Classical Column Generation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Comparison of Bundle and Classical Column Generation

C. Lemaréchal
  • Function : Author
Ph. Meurdesoif
  • Function : Author
S. Michel
  • Function : Author
N. Perrot
  • Function : Author
F. Vanderbeck
  • Function : Author

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 been used as alternatives to this standard. One of them is the bundle method; our aim is to illustrate its differences with Kelley's method. In the process we review alternative stabilization techniques used in column generation, comparing them from both primal and dual points of view. Numerical comparaisons are presented for five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot sizing, and traveling salesman.
Fichier principal
Vignette du fichier
RR-5453.pdf (685.32 Ko) Télécharger le fichier

Dates and versions

inria-00070554 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070554 , version 1

Cite

O. Briant, C. Lemaréchal, Ph. Meurdesoif, S. Michel, N. Perrot, et al.. Comparison of Bundle and Classical Column Generation. [Research Report] RR-5453, INRIA. 2005, pp.31. ⟨inria-00070554⟩
193 View
456 Download

Share

Gmail Facebook X LinkedIn More