Two-phase heuristics for the \(k\)-club problem

DOI10.1016/j.cor.2014.07.006zbMath1348.90150OpenAlexW2066875775MaRDI QIDQ337187

Maria Teresa Almeida, Filipa D. Carvalho

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.006

zbMATH Keywords

heuristicscomputational biologysocial network analysisclique relaxationsmaximum \(k\)-club

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Integer programming (90C10) Nonnumerical algorithms (68W05) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms

Cites Work

• Unnamed Item
• Breakout local search for maximum clique problems
• Algorithms for the maximum \(k\)-club problem in graphs
• Combinatorial algorithms for the maximum \(k\)-plex problem
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Upper bounds and heuristics for the 2-club problem
• Selected combinatorial problems of computational biology
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Heuristics for finding \(k\)-clubs in an undirected graph
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
• Clique-detection models in computational biochemistry and genomics
• Mining market data: a network approach
• Novel approaches for analyzing biological networks
• Extended and discretized formulations for the maximum clique problem
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• Integer models and upper bounds for the 3‐club problem