Name
Abstract | ||
|---|---|---|
A heuristic method is proposed for the solution of a large class of binary optimization problems, which includes weighted versions of the set covering, graph stability, partitioning, maximum satisfiability, and numerous other problems. The reported substantial computational experiments amply demonstrate the efficiency of the proposed method. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1023717307746 | J. Heuristics |
Keywords | Field | DocType |
Boolean optimization,heuristic,optical satisfiability | Maximum satisfiability problem,Mathematical optimization,Heuristic,Extremal optimization,Satisfiability,Boolean optimization,Null-move heuristic,Consistent heuristic,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
9 | 3 | 1572-9397 |
Citations | PageRank | References |
6 | 0.84 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Davoine | 1 | 6 | 0.84 |
| Peter L. Hammer | 2 | 1996 | 288.93 |
| Béla Vizvári | 3 | 77 | 9.40 |