| Article ID: | iaor2005688 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 6 |
| Start Page Number: | 523 |
| End Page Number: | 529 |
| Publication Date: | Nov 2004 |
| Journal: | Operations Research Letters |
| Authors: | Bomze Immanuel M., Locatelli Marco, Pelillo Marcello |
| Keywords: | graphs, heuristics |
In this paper we prove the equivalence between pivoting-based heuristic (PBH) for the maximum weight clique problem and a combinatorial greedy heuristic. It is also proved that PBH always returns a local solution although this is not always guaranteed for Lemke's method, on which PBH is based.