Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
From MaRDI portal
Publication:2820111
Recommendations
- Improvements to MCS algorithm for the maximum clique problem
- Speeding up branch and bound algorithms for solving the maximum clique problem
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Exact algorithms for maximum clique: a computational study
Cites work
- scientific article; zbMATH DE number 4064507 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A hybrid heuristic for the maximum clique problem
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Algorithm 457: finding all cliques of an undirected graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- Fast local search for the maximum independent set problem
- Greedy randomized adaptive search procedures
- Large Cliques Elude the Metropolis Process
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
Cited in
(3)
This page was built for publication: Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820111)