A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems
Bruno Nogueira () and
Rian G. S. Pinheiro
Additional contact information
Bruno Nogueira: Universidade Federal de Alagoas
Rian G. S. Pinheiro: Universidade Federal de Alagoas
Annals of Operations Research, 2020, vol. 284, issue 1, No 16, 367-400
Abstract:
Abstract Given a graph G(V, E) and a value $$s \in {\mathbb {N}}$$s∈N, an s-plex S is a subset of V such that each vertex $$v \in S$$v∈S has at least $$|S|-s$$|S|-s adjacent vertices in the subgraph induced by S. This work proposes a GPU based local search heuristic, called GPULS, for the problems of finding an s-plex of maximum cardinality and finding an s-plex of maximum weight. The proposed heuristic works well on both problems without any modification on its parameters or its code. GPULS considers two neighborhood structures, which are explored using tabu search and a first-improvement approach. We compare GPULS with the current best-performing exact methods and heuristics. The results obtained by GPULS are highly competitive, even when it runs on a CPU-only architecture. Moreover, we observed speedups of up to 16 times by running the heuristic on a hybrid CPU–GPU architecture.
Keywords: Clique relaxation; Maximum s-plex; Maximum clique; GPU; Tabu search; Metaheuristics (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03159-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:284:y:2020:i:1:d:10.1007_s10479-019-03159-5
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-019-03159-5
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().