From high-level model to branch-and-price solution in G12

Authors:
Jakob Puchinger;Peter J. Stuckey;Mark Wallace;Sebastian Brand
Affiliations:
NICTA Victoria Research Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia;NICTA Victoria Research Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia;School of Computer Science and Software Engineering, Monash University, Melbourne, Australia;NICTA Victoria Research Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia
Venue:
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Year:
2008

Citing 8
Cited 2

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
A Framework for Constraint Programming Based Column Generation

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions

Management Science
Flexible, rule-based constraint model linearisation

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
The g12 project: mapping solver independent models to efficient solutions

ICLP'05 Proceedings of the 21st international conference on Logic Programming
The modelling language zinc

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
ACD term rewriting

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

G12 - Towards the Separation of Problem Modelling and Problem Solving

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A high level language for solver independent model manipulation and generation of hybrid solvers

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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. 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.