Sciweavers

16 search results - page 4 / 4
» Propagation = Lazy Clause Generation
Sort
View
JAR
2011
112views more  JAR 2011»
13 years 6 days ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...