2 search results - page 1 / 1 » Conflict Directed Backjumping for Max-CSPs |
38
Voted
IJCAI
2007
15 years 24 days ago
2007
CP
2009
Springer
14 years 9 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...