| Article ID: | iaor20042319 |
| Country: | Netherlands |
| Volume: | 9 |
| Issue: | 3 |
| Start Page Number: | 229 |
| End Page Number: | 247 |
| Publication Date: | Jun 2003 |
| Journal: | Journal of Heuristics |
| Authors: | Hammer Peter L., Vizvri Bla, Davoine Thomas |
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.