Detecting critical nodes in sparse graphs via "reduce-solve-combine" memetic search
| Year of publication: |
2024
|
|---|---|
| Authors: | Zhou, Yangming ; Li, Jiaqi ; Hao, Jin-Kao ; Glover, Fred |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 1, p. 39-60
|
| Subject: | critical node problem | heuristic search | instance reduction | memetic search | reduce-solve-combine | Heuristik | Heuristics | Graphentheorie | Graph theory | Suchtheorie | Search theory |
-
Tabu search tutorial : a graph drawing application
Glover, Fred, (2021)
-
Metaheuristics for the Minimum Gap Graph Partitioning Problem
Bruglieri, Maurizio, (2021)
-
A fast vertex weighting-based local search for finding minimum connected dominating sets
Wu, Xinyun, (2022)
- More ...
-
Lai, Xiangjing, (2025)
-
A fast tri-individual memetic search approach for the distance-based critical node problem
Zhou, Yangming, (2023)
-
Heuristic search for rank aggregation with application to label ranking
Zhou, Yangming, (2024)
- More ...