Over-Constrained Problems

Willem-Jan Hoeve ()
Additional contact information
Willem-Jan Hoeve: Carnegie Mellon University

A chapter in Hybrid Optimization, 2011, pp 191-225 from Springer

Abstract: Abstract Over-constrained problems are ubiquitous in real-world applications. In constraint programming, over-constrained problems can be modeled and solved using soft constraints. Soft constraints, as opposed to hard constraints, are allowed to be violated, and the goal is to find a solution that minimizes the total amount of violation. In this chapter, an overview of recent developments in solution methods for over-constrained problems using constraint programming is presented, with an emphasis on soft global constraints.

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_6

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

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

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 ().