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.
Cite
CITATION STYLE
van Hoeve, W. J. (2011). Over-constrained problems. In Springer Optimization and Its Applications (Vol. 45, pp. 191–225). Springer International Publishing. https://doi.org/10.1007/978-1-4419-1644-0_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
