From High-Level Model to Branch-and-Price Solution in G12

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 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.
Type de document :
Communication dans un congrès
Laurent Perron; Michael A. Trick. CPAIOR 2008 , May 2008, Paris, France. Springer Berlin Heidelberg, Lecture Notes in Computer Science, 5015, pp.Pages 218-232, 2008, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 〈10.1007/978-3-540-68155-7_18〉
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01305397
Contributeur : Jakob Puchinger <>
Soumis le : jeudi 21 avril 2016 - 09:36:35
Dernière modification le : dimanche 22 janvier 2017 - 12:13:48
Document(s) archivé(s) le : vendredi 22 juillet 2016 - 11:00:13

Fichier

cpaior08_puchinger.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jakob Puchinger, Peter Stuckey, Mark Wallace, Sebastian Brand. From High-Level Model to Branch-and-Price Solution in G12. Laurent Perron; Michael A. Trick. CPAIOR 2008 , May 2008, Paris, France. Springer Berlin Heidelberg, Lecture Notes in Computer Science, 5015, pp.Pages 218-232, 2008, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 〈10.1007/978-3-540-68155-7_18〉. 〈hal-01305397〉

Partager

Métriques

Consultations de la notice

30

Téléchargements de fichiers

45