A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems
From MaRDI portal
Publication:2288976
DOI10.1007/s10479-019-03159-5zbMath1437.90140OpenAlexW2912992732WikidataQ128429325 ScholiaQ128429325MaRDI QIDQ2288976
Bruno Nogueira, Rian Gabriel S. Pinheiro
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03159-5
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A FPGA-based accelerated architecture for the continuous GRASP, Continuous cubic formulations for cluster detection problems in networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Combinatorial algorithms for the maximum \(k\)-plex problem
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- An exact algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- Maximum weight relaxed cliques and Russian doll search revisited
- Multivariate algorithmics for finding cohesive subnetworks
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- On clique relaxation models in network analysis
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- A graph‐theoretic generalization of the clique concept
- Handbook of metaheuristics
