The combinatorics of pivoting for the maximum weight clique

  • Authors:

  • Marco Locatelli;Immanuel M Bomze;Marcello Pelillo

  • Affiliations:

  • Dipartimento di Informatica, Universití di Torino, Corso Svizzera 185, 10149 Torino, Italy;Inst. für Statistik und Decision Support Systems, Universität Wien, Austria;Dipartimento di Informatica, Universití Ca' Foscari di Venezia, Italy

  • Venue:
  • Operations Research Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we prove the equivalence between a 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.