63 search results - page 10 / 13 » cp 2004 |
CP
2004
Springer
15 years 3 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
CP
2004
Springer
15 years 3 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
CP
2004
Springer
15 years 3 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...