%0 Conference Paper %F Oral %T From High-Level Model to Branch-and-Price Solution in G12 %+ University of Melbourne %+ National ICT Australia [Sydney] (NICTA) %+ Monash University [Malaysia] %A Puchinger, Jakob %A Stuckey, Peter, J %A Wallace, Mark %A Brand, Sebastian %< avec comité de lecture %3 Lecture Notes in Computer Science %B CPAIOR 2008 %C Paris, France %Y Laurent Perron %Y Michael A. Trick %I Springer Berlin Heidelberg %S Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems %V 5015 %P Pages 218-232 %8 2008-05-20 %D 2008 %R 10.1007/978-3-540-68155-7_18 %Z Computer Science [cs]/Operations Research [cs.RO]Conference papers %X 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 sub-problems, 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. %G English %2 https://inria.hal.science/hal-01305397/document %2 https://inria.hal.science/hal-01305397/file/cpaior08_puchinger.pdf %L hal-01305397 %U https://inria.hal.science/hal-01305397 %~ EC-PARIS %~ LGI %~ CENTRALESUPELEC %~ LGI-MO