A fast tri-individual memetic search approach for the distance-based critical node problem
From MaRDI portal
Publication:6167524
DOI10.1016/j.ejor.2022.11.039OpenAlexW4310068862MaRDI QIDQ6167524
Na Geng, Zhibin Jiang, Gezi Wang, Jin-Kao Hao, Yangming Zhou
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.039
combinatorial optimizationmetaheuristiccritical node problemmemetic searchdistance-based connectivity
Cites Work
- Unnamed Item
- Hybrid constructive heuristics for the critical node problem
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Online maximum \(k\)-coverage
- A preliminary analysis of the distance based critical node problem
- Detecting critical nodes in sparse graphs
- A memetic algorithm for graph coloring
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- The bi-objective critical node detection problem
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- Exact identification of critical nodes in sparse networks via new compact formulations
- TTT plots: a perl program to create time-to-target plots
- A memetic algorithm for the orienteering problem with hotel selection
- A new status index derived from sociometric analysis
- Efficient methods for the distance-based critical node detection problem in complex networks
- A faster algorithm for betweenness centrality*
- Multilevel Approaches for the Critical Node Problem
- Solving the Distance-Based Critical Node Problem
This page was built for publication: A fast tri-individual memetic search approach for the distance-based critical node problem
