The combinatorics of pivoting for the maximum weight clique.

DOI10.1016/j.orl.2004.02.005zbMath1054.90081OpenAlexW2170687773MaRDI QIDQ703275

Immanuel M. Bomze, Marcello Pelillo, Marco Locatelli

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.005

zbMATH Keywords

Combinatorial optimizationGreedy heuristicsLinear complementarityMaximum cliquePivoting methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Fixed interval scheduling: models, applications, computational complexity and algorithms, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, On the recursive largest first algorithm for graph colouring, On independent cliques and linear complementarity problems

Uses Software

• DIMACS

Cites Work

• A Complementary Pivoting Approach to the Maximum Weight Clique Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item