License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.33
URN: urn:nbn:de:0030-drops-21681
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2168/
Go to the corresponding Portal

Nemhauser, George ; Hewitt, Mike ; Savelsbergh, Martin

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

pdf-format:
09261.NemhauserGeorge.ExtAbstract.2168.pdf (0.05 MB)

Abstract

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.


BibTeX - Entry

@InProceedings{nemhauser_et_al:DagSemProc.09261.33,
  author =	{Nemhauser, George and Hewitt, Mike and Savelsbergh, Martin},
  title =	{{Using Branch-and-Price to Find High Quality Solutions Quickly}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2168},
  URN =		{urn:nbn:de:0030-drops-21681},
  doi =		{10.4230/DagSemProc.09261.33},
  annote =	{Keywords: Column generation, branch-and-price, mixed-integer programming, inventory routing}
}

Keywords: Column generation, branch-and-price, mixed-integer programming, inventory routing
Collection: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI