Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Dantzig-Wolfe decomposition and branch-and-price solving in G12

Dantzig-Wolfe decomposition and branch-and-price solving in G12,10.1007/s10601-009-9085-0,Constraints - An International Journal,Jakob Puchinger,Peter

Edit
Dantzig-Wolfe decomposition and branch-and-price solving in G12   (Citations: 2)
BibTex | RIS | RefWorks Download
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 models obtained 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.
Journal: Constraints - An International Journal - CONSTRAINTS , vol. 16, no. 1, pp. 77-99, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
More »
Sort by:

Citations (2)

Share this on