CP
2006
Springer
13 years 11 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Invariants that incrementally maintain the value of expresder assignments to their variables are a natural abstraction to build high-level local search algorithms. But th...
CP
2006
Springer
13 years 11 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
CP
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
CP
2006
Springer
13 years 11 months ago
2006
Springer
CP
2006
Springer
13 years 11 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
CP
2006
Springer
13 years 11 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
CP
2006
Springer
13 years 11 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide...
CP
2006
Springer
13 years 11 months ago
2006
Springer
