Tight LP-relaxations of overlapping global cardinality constraints
I Mourtos - International Conference on Integration of Constraint …, 2013 - Springer
International Conference on Integration of Constraint Programming, Artificial …, 2013•Springer
Motivation The global cardinality constraint (gcc) 7, written as cardinality (x, J; l, u), x_ j ∈ D_
j, j ∈ J, states that each value d is received by at least ld and by at most ud of the variables
xj: j∈ J, where d∈D=\textstyle⋃_j∈JD_j={0,...,|D|-1\}; also, 0≤ ld≤ ud and ud≥ 1 for all d∈
D. The gcc has several applications 2, 10, thus having been studied from the Constraint
Programming community mainly for accomplishing various forms of consistency 4, 6–8 or for
examining the tractability of a natural generalization 9.
j, j ∈ J, states that each value d is received by at least ld and by at most ud of the variables
xj: j∈ J, where d∈D=\textstyle⋃_j∈JD_j={0,...,|D|-1\}; also, 0≤ ld≤ ud and ud≥ 1 for all d∈
D. The gcc has several applications 2, 10, thus having been studied from the Constraint
Programming community mainly for accomplishing various forms of consistency 4, 6–8 or for
examining the tractability of a natural generalization 9.
Motivation
The global cardinality constraint (gcc) [7], written as states that each value d is received by at least ld and by at most ud of the variables {xj:j ∈ J}, where also, 0 ≤ l d ≤ ud and ud ≥ 1 for all d ∈ D. The gcc has several applications [2, 10], thus having been studied from the Constraint Programming community mainly for accomplishing various forms of consistency [4, 6–8] or for examining the tractability of a natural generalization [9].
Springer
Showing the best result for this search. See all results