Frequency-driven tabu search for the maximum \(s\)-plex problem
From MaRDI portal
Publication:1652378
DOI10.1016/j.cor.2017.05.005zbMath1391.90627OpenAlexW2610610869WikidataQ126089274 ScholiaQ126089274MaRDI QIDQ1652378
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.005
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
On solving simplified diversified top-\(k\,s\)-plex problem ⋮ An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ Continuous cubic formulations for cluster detection problems in networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Breakout local search for maximum clique problems
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- 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
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- A branch-and-bound approach for maximum quasi-cliques
- An exact algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- On the maximum quasi-clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Heuristics for finding \(k\)-clubs in an undirected graph
- On clique relaxation models in network analysis
- A review on algorithms for maximum clique problems
- Clique Relaxation Models in Social Network Analysis
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- A graph‐theoretic generalization of the clique concept
- Reducibility among Combinatorial Problems
This page was built for publication: Frequency-driven tabu search for the maximum \(s\)-plex problem
