Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP

DOI10.1145/293686.293690zbMath0956.68505OpenAlexW1998882407WikidataQ113310164 ScholiaQ113310164MaRDI QIDQ3836970

Stuart H. Smith, Thomas A. Feo, Mauricio G. C. Resende

Publication date: 3 January 2000

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/293686.293690

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items

Phased local search for the maximum clique problem ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ A hybrid heuristic for the maximum clique problem ⋮ Algorithm 787

Uses Software

• DIMACS