Name
Abstract | ||
|---|---|---|
We developed novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, which are variants of the algorithm
of Borchers & Furman (BFA) [1]. We improved BFA by (i) defining a lower bound of better quality, and (ii) incorporating a
new variable selection heuristic.
|
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-45193-8_115 | CP |
Keywords | Field | DocType |
lower bound,variable selection,branch and bound algorithm | Discrete mathematics,Mathematical optimization,Heuristic,Combinatorics,Branch and bound,Feature selection,Upper and lower bounds,Algorithm,Mathematics | Conference |
Citations | PageRank | References |
5 | 0.60 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jordi Planes | 1 | 486 | 31.38 |