5.268. multi_inter_distance
DESCRIPTION | LINKS |
- Origin
- Constraint
- Synonyms
, , , .
- Arguments
- Restrictions
- Purpose
Enforce that at most variables of the collection are assigned values in any set consisting of consecutive integer values.
- Example
-
The constraint holds since, for each set of consecutive values, no more than variables of the collection are assigned a value from that set:
At most two, in fact one, variables of the collection are assigned a value from the set .
At most two, in fact zero, variables of the collection are assigned a value from the set .
At most two, in fact two, variables of the collection are assigned a value from the set .
At most two, in fact two, variables of the collection are assigned a value from the set .
At most two, in fact two, variables of the collection are assigned a value from the set .
At most two, in fact one, variables of the collection are assigned a value from the set .
At most two, in fact one, variables of the collection are assigned a value from the set .
At most two, in fact two, variables of the collection are assigned a value from the set .
- Typical
- Symmetries
Items of are permutable.
One and the same constant can be added to the attribute of all items of .
can be increased.
can be decreased to any value .
- Arg. properties
Contractible wrt. .
- Usage
The constraint was tested for scheduling tasks that all have the same fixed duration in the context of air traffic management.
- Algorithm
P.Β Ouellet and C.-G.Β Quimper came up with a cubic time complexity algorithm achieving bound-consistency inΒ [OuelletQuimper11].
- See also
generalisation: Β (, of same length, replaced by ).
specialisation: Β ( parameter set to 1), Β (window of consecutive values replaced by window of size 1).
- Keywords
application area: air traffic management.
constraint type: predefined constraint, value constraint, scheduling constraint.