Two-phase heuristics for the k-club problem
DOI10.1016/J.COR.2014.07.006zbMATH Open1348.90150OpenAlexW2066875775MaRDI QIDQ337187FDOQ337187
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Nonnumerical algorithms (68W05) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Mining market data: a network approach
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- 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
- Extended and discretized formulations for the maximum clique problem
- Breakout local search for maximum clique problems
- Algorithms for the maximum \(k\)-club problem in graphs
- Combinatorial algorithms for the maximum \(k\)-plex problem
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Integer models and upper bounds for the 3-club problem
- Upper bounds and heuristics for the 2-club problem
- Selected combinatorial problems of computational biology
Cited In (9)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- Algorithms for the maximum \(k\)-club problem in graphs
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Upper bounds and heuristics for the 2-club problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Title not available (Why is that?)
- On provably best construction heuristics for hard combinatorial optimization problems
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
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)
