A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Musical Harmonization with Constraints: A Survey
Constraints
Meta-constraints on violations for over constrained problems
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Musical constraint satisfaction problems solved with adaptive search
Soft Computing - A Fusion of Foundations, Methodologies and Applications
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
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
Three generalizations of the FOCUS constraint
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Many Constraint Programming models use integer cost variables aggregated in an objective criterion. In this context, some constraints involving exclusively cost variables are often imposed. Such constraints are complementary to the objective function. They characterize the solutions which are acceptable in practice. This paper deals with the case where the set of costs is a sequence, in which high values should be concentrated in a few number of areas. Representing such a property through a search heuristic may be complex and overall not precise enough. To solve this issue, we introduce a new constraint, Focus(X, yc,len, k), where X is a sequence of n integer variables, yc an integer variable, and len and k are two integers. To satisfy Focus, the minimum number of distinct sub-sequences of consecutive variables in X, of length at most len and that involve exclusively values strictly greater than k, should be less than or equal to yc. We present two examples of problems involving Focus. We propose a complete filtering algorithm in O(n) time complexity.