A hybrid heuristic for the maximum clique problem
From MaRDI portal
Publication:2491328
Recommendations
- scientific article; zbMATH DE number 2079894
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- A pivoting-based heuristic for the maximum clique problem.
Cites work
- A complementary pivoting approach to the maximum weight clique problem
- A genetic algorithm for the set covering problem
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A new trust region technique for the maximum weight clique problem
- Adaptive, restart, randomized greedy heuristics for maximum clique
- Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
- An exact algorithm for the maximum clique problem
- Ant colony optimization.
- Approximation algorithms for combinatorial problems
- scientific article; zbMATH DE number 4134072 (Why is no real title available?)
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1961993 (Why is no real title available?)
- scientific article; zbMATH DE number 2079894 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- scientific article; zbMATH DE number 956841 (Why is no real title available?)
- scientific article; zbMATH DE number 956850 (Why is no real title available?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Optimized Crossover for the Independent Set Problem
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Reactive local search for the maximum clique problem
Cited in
(17)- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A variable neighborhood search heuristic for the maximum ratio clique problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- Speeding up branch and bound algorithms for solving the maximum clique problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- Improvements to MCS algorithm for the maximum clique problem
- A study of ACO capabilities for solving the maximum clique problem
- A review on algorithms for maximum clique problems
- Hybrid constructive heuristics for the critical node problem
- Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
- Breakout local search for maximum clique problems
- An adaptive multistart tabu search approach to solve the maximum clique problem
- scientific article; zbMATH DE number 2079894 (Why is no real title available?)
- scientific article; zbMATH DE number 1560332 (Why is no real title available?)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- scientific article; zbMATH DE number 956848 (Why is no real title available?)
This page was built for publication: A hybrid 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 Q2491328)
