2 search results - page 1 / 1 » Conflict Directed Backjumping for Max-CSPs |
34
Voted
IJCAI
2007
14 years 11 months ago
2007
CP
2009
Springer
14 years 7 months ago
2009
Springer
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...