SIMPL

A system for integrating optimization techniques

Ionuţ Aron, John N. Hooker, Tallys Yunes

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling framework and the ability to combine complementary strengths of the two solution technologies. This research has reached a stage at which further development would benefit from a general-purpose modeling and solution system. We introduce here a system for integrated modeling and solution called SIMPL. Our approach is to view CP and OR techniques as special cases of a single method rather than as separate methods to be combined. This overarching method consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage. We describe the main features of SIMPL and illustrate its usage with examples.

Original languageEnglish (US)
Pages (from-to)21-36
Number of pages16
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3011
StatePublished - Dec 1 2004
Externally publishedYes

Fingerprint

Operations research
Constraint Programming
Operations Research
Optimization Techniques
Integrated Modeling
Combinatorial optimization
Combinatorial Optimization Problem
Modeling
Cycle

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{9ec188d81c1a44c2a667258badfcbd28,
title = "SIMPL: A system for integrating optimization techniques",
abstract = "In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling framework and the ability to combine complementary strengths of the two solution technologies. This research has reached a stage at which further development would benefit from a general-purpose modeling and solution system. We introduce here a system for integrated modeling and solution called SIMPL. Our approach is to view CP and OR techniques as special cases of a single method rather than as separate methods to be combined. This overarching method consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage. We describe the main features of SIMPL and illustrate its usage with examples.",
author = "Ionuţ Aron and Hooker, {John N.} and Tallys Yunes",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
volume = "3011",
pages = "21--36",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - SIMPL

T2 - A system for integrating optimization techniques

AU - Aron, Ionuţ

AU - Hooker, John N.

AU - Yunes, Tallys

PY - 2004/12/1

Y1 - 2004/12/1

N2 - In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling framework and the ability to combine complementary strengths of the two solution technologies. This research has reached a stage at which further development would benefit from a general-purpose modeling and solution system. We introduce here a system for integrated modeling and solution called SIMPL. Our approach is to view CP and OR techniques as special cases of a single method rather than as separate methods to be combined. This overarching method consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage. We describe the main features of SIMPL and illustrate its usage with examples.

AB - In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and solve combinatorial optimization problems. These advantages include a more versatile modeling framework and the ability to combine complementary strengths of the two solution technologies. This research has reached a stage at which further development would benefit from a general-purpose modeling and solution system. We introduce here a system for integrated modeling and solution called SIMPL. Our approach is to view CP and OR techniques as special cases of a single method rather than as separate methods to be combined. This overarching method consists of an infer-relax-restrict cycle in which CP and OR techniques may interact at any stage. We describe the main features of SIMPL and illustrate its usage with examples.

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

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

M3 - Article

VL - 3011

SP - 21

EP - 36

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -