Name
Abstract | ||
|---|---|---|
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. We provide experimental evidence that our solver outperforms some of the best performing Max-SAT solvers on a wide range of instances. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30498-2_34 | ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2004 |
Keywords | Field | DocType |
Max-SAT,branch and bound,lower bound,heuristics,data structures | Maximum satisfiability problem,Data structure,Branch and bound,Feature selection,Computer science,Upper and lower bounds,Algorithm,Heuristics,Solver,Branch and bound method | Conference |
Volume | ISSN | Citations |
3315 | 0302-9743 | 11 |
PageRank | References | Authors |
0.86 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa Alsinet | 1 | 340 | 27.72 |
| Felip Manyà | 2 | 787 | 59.52 |
| Jordi Planes | 3 | 486 | 31.38 |