Sciweavers

79 search results - page 10 / 16
» Arc-Consistency and Arc-Consistency Again
Sort
View
CP
2005
Springer
14 years 1 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
CPAIOR
2006
Springer
13 years 11 months ago
Improved Algorithm for the Soft Global Cardinality Constraint
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
Alessandro Zanarini, Michela Milano, Gilles Pesant
IJCAI
2007
13 years 9 months ago
The Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 7 months ago
The Role of Commutativity in Constraint Propagation Algorithms
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
Krzysztof R. Apt
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 4 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...