A pivoting-based heuristic for the maximum clique problem.

MaRDI QIDQ2768058zbMATH OpenFDO

Authors Alessio Massaro, Marcello Pelillo

Publication date 2001

zbMATH Keywords

Lemke's algorithmlinear complementarity problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming involving graphs or networks (90C35)

Recommendations

• A complementary pivoting approach to the maximum weight clique problem
• The combinatorics of pivoting for the maximum weight clique.
• A branch and bound algorithm for the maximum clique problem
• scientific article; zbMATH DE number 956840
• The maximum clique problem

Cited in

(7)

• A variable neighborhood search heuristic for the maximum ratio clique problem
• A hybrid heuristic for the maximum clique problem
• A complementary pivoting approach to the maximum weight clique problem
• Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
• scientific article; zbMATH DE number 1560332 (Why is no real title available?)
• scientific article; zbMATH DE number 956845 (Why is no real title available?)
• The combinatorics of pivoting for the maximum weight clique.

This page was built for publication: A pivoting-based heuristic for the maximum clique problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768058)