Two-phase heuristics for the k-club problem

DOI10.1016/J.COR.2014.07.006MaRDI QIDQ337187zbMATH OpenOpenAlexFDO

Authors 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

heuristicssocial network analysiscomputational biologyclique relaxationsmaximum \(k\)-club

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the maximum k-club problem in graphs
• Upper bounds and heuristics for the 2-club problem
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Heuristics for finding \(k\)-clubs in an undirected graph
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• Algorithms for the maximum \(k\)-club problem in graphs
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Breakout local search for maximum clique problems
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• Clique-detection models in computational biochemistry and genomics
• Combinatorial algorithms for the maximum \(k\)-plex problem
• Extended and discretized formulations for the maximum clique problem
• Heuristics for finding \(k\)-clubs in an undirected graph
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• Integer models and upper bounds for the 3-club problem
• Mining market data: a network approach
• Novel approaches for analyzing biological networks
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Selected combinatorial problems of computational biology
• Upper bounds and heuristics for the 2-club problem

Cited in

(9)

• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
• Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
• Algorithms for the maximum \(k\)-club problem in graphs
• scientific article; zbMATH DE number 7059787 (Why is no real title available?)
• On provably best construction heuristics for hard combinatorial optimization problems
• Upper bounds and heuristics for the 2-club problem
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Heuristics for finding \(k\)-clubs in an undirected graph
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph

This page was built for publication: Two-phase heuristics for the \(k\)-club problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337187)