In this paper we introduce a new cardinality constraint: ORDEREDDISTRIBUTE. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not...
-
October 27, 2010 (v1)Conference paperUploaded on: December 3, 2022
-
October 27, 2010 (v1)Conference paper
In this paper we introduce a new cardinality constraint: ORDEREDDISTRIBUTE. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not...
Uploaded on: February 22, 2023 -
May 23, 2011 (v1)Conference paper
Constraint toolkits generally propose a sum constraint where a global objective variable should be equal to a sum of local objective variables, on which bound-consistency is achieved. To solve optimization problems this propagation is poor. Therefore, ad-hoc techniques are designed for pruning the global objective variable by taking account of...
Uploaded on: December 4, 2022 -
2011 (v1)Journal article
In this paper we introduce a new cardinality constraint: Ordered Distribute. Given a set of variables, this constraint limits for each value v the number of times v or any value greater than v is taken. It extends the global cardinality constraint, that constrains only the number of times a value v is taken by a set of variables and does not...
Uploaded on: December 4, 2022 -
September 12, 2011 (v1)Conference paper
Given a sequence of variables X = 〈x 0, x 1, ..., x n − 1 〉, we consider the IncreasingSum constraint, which imposes ∀ i ∈ [0, n − 2] x i ≤ x i + 1, and ∑xi∈Xxi=s . We propose an Θ(n) bound-consistency algorithm for IncreasingSum
Uploaded on: December 4, 2022 -
2003 (v1)Conference paper
Partial constraint satisfaction [5] was widely studied in the 90's, and notably Max-CSP solving algorithms [21, 20, 1, 10]. These algorithms compute a lower bound of violated constraints without using propagation. Therefore, recent methods focus on the exploitation of propagation mechanisms to improve the solving process. Soft arc-consistency...
Uploaded on: February 28, 2023 -
November 4, 2022 (v1)Journal article
HR+ breast cancers are defined by the prominence of signaling pathways dependent on the estrogen receptor. Endocrine therapy is the standard treatment for these advanced diseases. Resistance to these treatments, called hormone resistance, appears invariably with biological mechanisms that have led to the development of therapeutic...
Uploaded on: February 4, 2024 -
August 2012 (v1)Conference paper
This paper gives an O(nlog n) bound-consistency filtering algorithm for the conjunction alldifferent(V0,V1,...,Vn−1)∧ f(V0)⌖f(V1)⌖...⌖f(Vn−1)≤ cst, (V0,V1,...,Vn−1,cst∊ +), where (,⌖) is a commutative group, f is a unary function, and both ⌖ and f are monotone increasing. This complexity is equal to the complexity of the bound-consistency...
Uploaded on: December 2, 2022