Using Branch-and-Price to Find High Quality Solutions Quickly

Authors George Nemhauser, Mike Hewitt, Martin Savelsbergh

Thumbnail PDF


  • Filesize: 53 kB
  • 2 pages

Document Identifiers

Author Details

George Nemhauser
Mike Hewitt
Martin Savelsbergh

Cite AsGet BibTex

George Nemhauser, Mike Hewitt, and Martin Savelsbergh. Using Branch-and-Price to Find High Quality Solutions Quickly. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


We develop an exact solution approach for integer programs that produces high- quality solutions quickly by solving well-chosen restrictions of the problem. Column generation is used both for generating these problem restrictions and for producing bounds on the value of an optimal solution to the problem. Obtaining primal solutions by solving problem restrictions also provides an easy way to search for improved solutions in the neighborhood of the current best solution. The overall approach is parallelized and computational experiments demonstrate its efficacy. An application to inventory routing is presented.
  • Column generation
  • branch-and-price
  • mixed-integer programming
  • inventory routing


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads