CP
2005
Springer
13 years 10 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
CP
2005
Springer
13 years 10 months ago
2005
Springer
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...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
CP
2005
Springer
13 years 10 months ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Preferences and uncertainty occur in many real-life problems. The theory of possibility is one way of dealing with uncertainty, which allows for easy integration with fuzzy prefer...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
CP
2005
Springer
13 years 10 months ago
2005
Springer