Flexible, rule-based constraint model linearisation

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

Flexible, rule-based constraint model linearisation

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

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

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.

Original language	English
Title of host publication	Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings
Pages	68-83
Number of pages	16
Publication status	Published - 1 Dec 2007
Externally published	Yes
Event	10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008 - San Francisco, CA, United States of America Duration: 7 Jan 2008 → 8 Jan 2008

Publication series

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

Conference

Conference	10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008
Country	United States of America
City	San Francisco, CA
Period	7/01/08 → 8/01/08

Access to Document

Link to publication in Scopus

Cite this

Brand, S., Duck, G. J., Puchinger, J., & Stuckey, P. J. (2007). Flexible, rule-based constraint model linearisation. In Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings (pp. 68-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4902 LNCS).

Brand, Sebastian ; Duck, Gregory J. ; Puchinger, Jakob ; Stuckey, Peter J. / Flexible, rule-based constraint model linearisation. Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings. 2007. pp. 68-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ccff2b0f0f1545c88fc5d1453fcc46b9,

title = "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.",

author = "Sebastian Brand and Duck, {Gregory J.} and Jakob Puchinger and Stuckey, {Peter J.}",

year = "2007",

month = dec,

day = "1",

language = "English",

isbn = "3540774416",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "68--83",

booktitle = "Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings",

note = "10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008 ; Conference date: 07-01-2008 Through 08-01-2008",

}

Brand, S, Duck, GJ, Puchinger, J & Stuckey, PJ 2007, Flexible, rule-based constraint model linearisation. in Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4902 LNCS, pp. 68-83, 10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008, San Francisco, CA, United States of America, 7/01/08.

Flexible, rule-based constraint model linearisation. / Brand, Sebastian; Duck, Gregory J.; Puchinger, Jakob; Stuckey, Peter J.

Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings. 2007. p. 68-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4902 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Flexible, rule-based constraint model linearisation

AU - Brand, Sebastian

AU - Duck, Gregory J.

AU - Puchinger, Jakob

AU - Stuckey, Peter J.

PY - 2007/12/1

Y1 - 2007/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=38549139771&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:38549139771

SN - 3540774416

SN - 9783540774419

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 68

EP - 83

BT - Practical Aspects of Declarative Languages - 10th International Symposium, PADL 2008, Proceedings

T2 - 10th International Symposium on Practical Aspects of Declarative Languages, PADL 2008

Y2 - 7 January 2008 through 8 January 2008

ER -