Flexible, Rule-Based Constraint Model Linearisation

Sebastian Brand (1, 2) , Gregory J Duck (1, 2) , Jakob Puchinger (2, 1) , Peter J Stuckey (2, 1)

1 University of Melbourne
2 NICTA - National ICT Australia [Sydney]

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.

Domaines: Recherche opérationnelle [math.OC]

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