Three generalizations of the FOCUS constraint

Authors:
Nina Narodytska;Thierry Petit;Mohamed Siala;Toby Walsh
Affiliations:
NICTA and UNSW, Sydney, Australia;LINA-CNRS, Mines-Nantes, INRIA, Nantes, France;LAAS-CNRS, Univ de Toulouse, INSA, Toulouse, France;NICTA and UNSW, Sydney, Australia
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 7
Cited 0

Algorithms

Algorithms
The Deviation Constraint

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Scalable Load Balancing in Nurse to Patient Assignment Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Global propagation of practicability constraints

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Filtering algorithms for discrete cumulative problems with overloads of resource

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
FOCUS: a constraint for concentrating high costs

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The FOCUS constraint expresses the notion that solutions are concentrated. In practice, this constraint suffers from the rigidity of its semantics. To tackle this issue, we propose three generalizations of the FOCUS constraint. We provide for each one a complete filtering algorithm as well as discussing decompositions.