2026-08-12T07:16:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2164 2024-03-06T11:08:48Z ddc:004 open_access

Branch-and-Price Solving in G12 Puchinger, Jakob Stuckey, Peter Wallace, Mark Brand, Sebastian Combinatorial optimization branch-and-price software 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jakob Puchinger and Peter Stuckey and Mark Wallace and Sebastian Brand 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.6 urn:nbn:de:0030-drops-21641 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.6 eng https://creativecommons.org/licenses/by/4.0/legalcode