Global Constraints: A Survey

Jean-Charles Régin ()
Additional contact information
Jean-Charles Régin: Université de Nice-Sophia Antipolis

A chapter in Hybrid Optimization, 2011, pp 63-134 from Springer

Abstract: Abstract Constraint programming (CP) is mainly based on filtering algorithms; their association with global constraints is one of the main strengths of CP because they exploit the specific structure of each constraint. This chapter is an overview ofthese two techniques. A collection of the most frequently used global constraints is given and some filtering algorithms are detailed. In addition, we try to identify how filtering algorithms can be designed. At last, we identify some problems that deserve to be addressed in the future.

Keywords: Minimum Span Tree; Constraint Programming; Global Constraint; Binary Constraint; Sequence Constraint (search for similar items in EconPapers)
Date: 2011
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:spochp:978-1-4419-1644-0_3

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

DOI: 10.1007/978-1-4419-1644-0_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().