Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements
- 1 January 2013
- book chapter
- Published by Springer Nature in Springer Proceedings in Mathematics & Statistics
- p. 93-99
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fast local search for the maximum independent set problemJournal of Heuristics, 2012
- Simple ingredients leading to very efficient heuristics for the maximum clique problemJournal of Heuristics, 2007
- An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational ExperimentsJournal of Global Optimization, 2006
- A hybrid heuristic for the maximum clique problemJournal of Heuristics, 2006
- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique2003
- Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueLecture Notes in Computer Science, 2002
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Large Cliques Elude the Metropolis ProcessRandom Structures & Algorithms, 1992
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973