6 search results - page 2 / 2 » Constraint Satisfaction for Multiple Capacitated Job Shop Sc... |
CP
2007
Springer
13 years 11 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...