2 search results - page 1 / 1 » Speeding Up Constrained Path Solvers with a Reachability Pro... |
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...
CONSTRAINTS
2007
13 years 4 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...