Flexible, rule-based constraint model linearisation

Sebastian Brand, Gregory J. Duck, Jakob Puchinger, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

10 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationPractical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings
Number of pages16
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008 - San Francisco, CA, United States of America
Duration: 7 Jan 20088 Jan 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4902 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008
Country/TerritoryUnited States of America
CitySan Francisco, CA

Cite this