Phased local search for the maximum clique problem
From MaRDI portal
Publication:2369988
DOI10.1007/s10878-006-9635-yzbMath1255.90122OpenAlexW2138147909MaRDI QIDQ2369988
Publication date: 21 June 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9635-y
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (17)
Subgraph extraction and metaheuristics for the maximum clique problem ⋮ A review on algorithms for maximum clique problems ⋮ Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ Breakout local search for maximum clique problems ⋮ An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ 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 ⋮ An efficient local search for the feedback vertex set problem ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ Maximum cut-clique problem: ILS heuristics and a data analysis application ⋮ Approximating the maximum vertex/edge weighted clique using local search ⋮ Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ An analysis of parameter adaptation in reactive tabu search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the maximum clique
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Approximating maximum independent sets by excluding subgraphs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- A new trust region technique for the maximum weight clique problem
- Finding a Maximum Clique in an Arbitrary Graph
- Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
- Reactive local search for the maximum clique problem
This page was built for publication: Phased local search for the maximum clique problem
