An efficient local search algorithm for solving maximum edge weight clique problem in large graphs

DOI10.1007/s10878-020-00529-9zbMath1442.90159OpenAlexW3004715904MaRDI QIDQ2175041

Haihang You, Chuan Luo, Yi Chu, Boxiao Liu, Shaowei Cai

Publication date: 27 April 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00529-9

zbMATH Keywords

stochastic local searchgraph reductionmaximum edge weight clique problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• NuMVC
• CCASat
• KONECT
• CCLS
• CCEHC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breakout local search for maximum clique problems
• Local search for Boolean satisfiability with configuration checking and subscore
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Improving configuration checking for satisfiable random \(k\)-SAT instances
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• An exact bit-parallel algorithm for the maximum clique problem
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• An exact algorithm for the maximum clique problem
• Approximating the maximum vertex/edge weighted clique using local search
• An extended formulation approach to the edge-weighted maximal clique problem
• Multi-neighborhood tabu search for the maximum weight clique problem
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
• A new family of facet defining inequalities for the maximum edge-weighted clique problem
• Phased local search for the maximum clique problem
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
• Reactive local search for the maximum clique problem

This page was built for publication: An efficient local search algorithm for solving maximum edge weight clique problem in large graphs