Flexible, Rule-Based Constraint Model Linearisation

Abstract : Nonlinear constraint satisfaction or optimisation models need to be reduced to equivalent linear forms before they can be solved by (Integer) Linear Programming solvers. A choice of linearisation methods exist. There are generic linearisations and constraint-specific, user-defined linearisations. Hence a model reformulation system needs to be flexible and open to allow complex and novel linearisations to be specified. In this paper we show how the declarative model reformulation system Cadmium can be used to effectively transform constraint problems to different linearisations, allowing easy exploration of linearisation possibilities.
Type de document :
Communication dans un congrès
Practical Aspects of Declarative Languages, 10th International Symposium, PADL 2008, Jan 2008, San Francisco, United States. Lecture Notes in Computer Science, 4902, pp.Pages 68-83, 2008, Practical Aspects of Declarative Languages. 〈10.1007/978-3-540-77442-6_6〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01301576
Contributeur : Jakob Puchinger <>
Soumis le : jeudi 21 avril 2016 - 09:28:53
Dernière modification le : dimanche 22 janvier 2017 - 12:13:47
Document(s) archivé(s) le : vendredi 22 juillet 2016 - 10:23:17

Fichier

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

Identifiants

Collections

Citation

Sebastian Brand, Gregory Duck, Jakob Puchinger, Peter Stuckey. Flexible, Rule-Based Constraint Model Linearisation. Practical Aspects of Declarative Languages, 10th International Symposium, PADL 2008, Jan 2008, San Francisco, United States. Lecture Notes in Computer Science, 4902, pp.Pages 68-83, 2008, Practical Aspects of Declarative Languages. 〈10.1007/978-3-540-77442-6_6〉. 〈hal-01301576〉

Partager

Métriques

Consultations de la notice

41

Téléchargements de fichiers

37