44 search results - page 1 / 9 » On Solving Boolean Optimization with Satisfiability-Based Al... |
AMAI
2000
Springer
13 years 8 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
AMAI
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
JAR
2011
12 years 11 months ago
2011
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 ...