Phased local search for the maximum clique problem
From MaRDI portal
Publication:2369988
Recommendations
Cites work
- A new trust region technique for the maximum weight clique problem
- Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
- Approximating maximum independent sets by excluding subgraphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Finding a Maximum Clique in an Arbitrary Graph
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079894 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956843 (Why is no real title available?)
- Reactive local search for the maximum clique problem
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Variable neighborhood search for the maximum clique
Cited in
(22)- Approximating the maximum vertex/edge weighted clique using local search
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Reactive and dynamic local search for max-clique: engineering effective building blocks
- An effective local search for the maximum clique problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- An efficient local search for the feedback vertex set problem
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- A review on algorithms for maximum clique problems
- Maximum cut-clique problem: ILS heuristics and a data analysis application
- A three-phased local search approach for the clique partitioning problem
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- Breakout local search for maximum clique problems
- An adaptive multistart tabu search approach to solve the maximum clique problem
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- An analysis of parameter adaptation in reactive tabu search
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- Reactive local search for the maximum clique problem
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
This page was built for publication: Phased local search for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369988)
