Constraint Languages for Combinatorial Optimization

Pascal Hentenryck () and Laurent Michel ()
Additional contact information
Pascal Hentenryck: Brown University
Laurent Michel: University of Connecticut

Chapter Chapter 3 in Tutorials on Emerging Methodologies and Applications in Operations Research, 2005, pp 3-1-3-45 from Springer

Abstract: Abstract This tutorial reviews recent developments in the design and implementation of constraint languages for combinatorial optimization. In particular, it argues that constraint-based languages are a unifying technology to express combinatorial optimization problems, supporting a variety of solvers including constraint programming, local search, and mathematical programming.

Keywords: Neighborhood Search; Precedence Constraint; Jobshop Schedule; Incremental Variable; Constraint Language (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-0-387-22827-3_3

Ordering information: This item can be ordered from
http://www.springer.com/9780387228273

DOI: 10.1007/0-387-22827-6_3

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().