DMCA
Dantzig-Wolfe Decomposition and Branch-and-Price Solving in G12
| Venue: | CONSTRAINTS |
| Citations: | 7 - 0 self |
BibTeX
@MISC{Puchinger_dantzig-wolfedecomposition,
author = {Jakob Puchinger and Peter J. Stuckey and Mark Wallace and Sebastian Brand},
title = {Dantzig-Wolfe Decomposition and Branch-and-Price Solving in G12},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The date of receipt and acceptance will be inserted by the editor 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. Dantzig-Wolfe decomposition is automatically performed using the additional information given by the model annotations. The obtained models can then be solved using column generation and branch-and-price. G12 supports the selection of specialised subproblem solvers, the aggregation of identical subproblems to reduce symmetries, automatic disaggregation when required by branch-and-bound, the use of specialised subproblem constraint-branching rules, and different master problem solvers including a hybrid solver based on the volume algorithm. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing.
Keyphrases
branch-and-price solving dantzig-wolfe decomposition model annotation different master problem solver specialised subproblem constraint-branching rule g12 project column generation specialised subproblem solver efficient combination high-level model software environment two-dimensional bin packing obtained model combinatorial problem editor abstract identical subproblems volume algorithm hybrid solver trucking problem g12 framework automatic disaggregation additional information
