License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21641
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2164/

Puchinger, Jakob ; Stuckey, Peter ; Wallace, Mark ; Brand, Sebastian

Branch-and-Price Solving in G12

pdf-format:
Dokument 1.pdf (75 KB)


Abstract

The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-price solving. G12 supports the selection of specialised subproblem solvers, the aggregation of identical subproblems, automatic disaggregation when required by search, and the use of specialised branching rules. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing.

BibTeX - Entry

@InProceedings{puchinger_et_al:DSP:2009:2164,
  author =	{Jakob Puchinger and Peter Stuckey and Mark Wallace and Sebastian Brand},
  title =	{Branch-and-Price Solving in G12},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2164},
  annote =	{Keywords: Combinatorial optimization, branch-and-price, software}
}

Keywords: Combinatorial optimization, branch-and-price, software
Seminar: 09261 - Models and Algorithms for Optimization in Logistics
Issue date: 2009
Date of publication: 02.10.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI