From high-level model to branch-and-price solution in G12
Jakob Puchinger, Peter J Stuckey, Mark Wallace, Sebastian Brand, L Perron (ed.), MA Trick (ed.)
INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS | SPRINGER-VERLAG BERLIN | Published : 2008
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 sub-problem 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. © 2008 Springer-Verlag Berlin Heidelberg.
We would like to thank the members of the G12 team at NICTA VRL for helpful discussions and implementation work.NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Centre of Excellence program.