A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems

DOI10.1007/S10479-019-03159-5zbMATH Open1437.90140OpenAlexW2912992732WikidataQ128429325 ScholiaQ128429325MaRDI QIDQ2288976FDOQ2288976

Authors: Bruno Nogueira, Rian G. 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

Recommendations

• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
• GPU Computing for Parallel Local Search Metaheuristic Algorithms
• GPU implementation of a multiobjective search algorithm

zbMATH Keywords

metaheuristicsmaximum cliquetabu searchclique relaxationGPUmaximum \(s\)-plex

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A fast algorithm for the maximum clique problem
• On clique relaxation models in network analysis
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
• A graph‐theoretic generalization of the clique concept
• Handbook of metaheuristics
• Multi-neighborhood tabu search for the maximum weight clique problem
• An adaptive multistart tabu search approach to solve the maximum clique problem
• An exact algorithm for the maximum clique problem
• Title not available (Why is that?)
• Combinatorial algorithms for the maximum \(k\)-plex problem
• A network-based data mining approach to portfolio selection via weighted clique relaxations
• 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
• Title not available (Why is that?)
• 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

Cited In (4)

• Continuous cubic formulations for cluster detection problems in networks
• Optimization problems for the maximum \(k\)-plex
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
• A FPGA-based accelerated architecture for the continuous GRASP

Uses Software

• CUDA
• ils-mwis
• gpuls-mwcp

This page was built for publication: A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems

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