Approximating the maximum vertex/edge weighted clique using local search
From MaRDI portal
(Redirected from Publication:1009183)
Recommendations
Cites work
- A fast algorithm for the maximum weight clique problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- Annealed replication: A new heuristic for the maximum clique problem
- 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 956839 (Why is no real title available?)
- Phased local search for the maximum clique problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
Cited in
(29)- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Reactive and dynamic local search for max-clique: engineering effective building blocks
- Clustered maximum weight clique problem: algorithms and empirical analysis
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Phased local search for the maximum clique problem
- A review on algorithms for maximum clique problems
- Solving the maximum vertex weight clique problem via binary quadratic programming
- 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
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
- On the approximability of the minimum weight t-partite clique problem
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- Common object discovery as local search for maximum weight cliques in a global object similarity graph
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Complexity and heuristics for the weighted max cut‐clique problem
- Exact and heuristic solution approaches for the generalized independent set problem
- Jumping particle swarm-based local search approach for the maximum weighted independent set problem
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
This page was built for publication: Approximating the maximum vertex/edge weighted clique using local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009183)
