A Declarative Modeling Framework that Integrates Solution Methods

J. N. Hooker, Hak Jin Kim, G. Ottosson

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any "checker" and any special-purpose "solver". In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine.

Original languageEnglish
Pages (from-to)141-161
Number of pages21
JournalAnnals of Operations Research
Volume104
Issue number1-4
DOIs
Publication statusPublished - 2001 Dec 1

Fingerprint

Modeling
Constraint programming
Mathematical programming
Linear programming
System modeling
Nonlinear programming
Language modeling
Propagation

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this

Hooker, J. N. ; Kim, Hak Jin ; Ottosson, G. / A Declarative Modeling Framework that Integrates Solution Methods. In: Annals of Operations Research. 2001 ; Vol. 104, No. 1-4. pp. 141-161.
@article{393320ce13304f4cab906c31aa87d2c3,
title = "A Declarative Modeling Framework that Integrates Solution Methods",
abstract = "Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any {"}checker{"} and any special-purpose {"}solver{"}. In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine.",
author = "Hooker, {J. N.} and Kim, {Hak Jin} and G. Ottosson",
year = "2001",
month = "12",
day = "1",
doi = "10.1023/A:1013195004424",
language = "English",
volume = "104",
pages = "141--161",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer Netherlands",
number = "1-4",

}

A Declarative Modeling Framework that Integrates Solution Methods. / Hooker, J. N.; Kim, Hak Jin; Ottosson, G.

In: Annals of Operations Research, Vol. 104, No. 1-4, 01.12.2001, p. 141-161.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Declarative Modeling Framework that Integrates Solution Methods

AU - Hooker, J. N.

AU - Kim, Hak Jin

AU - Ottosson, G.

PY - 2001/12/1

Y1 - 2001/12/1

N2 - Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any "checker" and any special-purpose "solver". In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine.

AB - Constraint programming offers modeling features and solution methods that are unavailable in mathematical programming but are often flexible and efficient for scheduling and other combinatorial problems. Yet mathematical programming is well suited to declarative modeling languages and is more efficient for some important problem classes. This raises this issue as to whether the two approaches can be combined in a declarative modeling framework. This paper proposes a general declarative modeling system in which the conditional structure of the constraints shows how to integrate any "checker" and any special-purpose "solver". In particular this integrates constraint programming and optimization methods, because the checker can consist of constraint propagation methods, and the solver can be a linear or nonlinear programming routine.

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

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

U2 - 10.1023/A:1013195004424

DO - 10.1023/A:1013195004424

M3 - Article

VL - 104

SP - 141

EP - 161

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1-4

ER -