Sciweavers

2 search results - page 1 / 1
» Conflict Directed Backjumping for Max-CSPs
Sort
View
CP
2009
Springer
13 years 2 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey