A fast tri-individual memetic search approach for the distance-based critical node problem

DOI10.1016/J.EJOR.2022.11.039MaRDI QIDQ6167524zbMATH OpenOpenAlexFDO

Authors Yangming Zhou, Gezi Wang, Jin-Kao Hao, Na Geng, Zhibin Jiang

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

zbMATH Keywords

combinatorial optimizationcritical node problemdistance-based connectivitymemetic searchmetaheuristic

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A genetic algorithm for a class of critical node problems
• A memetic algorithm based on tabu search for k-cardinality tree problems
• A memetic algorithm for the multi trip vehicle routing problem
• A memetic algorithm for multi-objective dynamic location problems
• An efficient memetic algorithm for the graph partitioning problem

Cites work

• A faster algorithm for betweenness centrality*
• A memetic algorithm for graph coloring
• A memetic algorithm for the orienteering problem with hotel selection
• A new status index derived from sociometric analysis
• A preliminary analysis of the distance based critical node problem
• A randomized algorithm with local search for containment of pandemic disease spread
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
• An integer programming framework for critical elements detection in graphs
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Detecting critical nodes in sparse graphs
• Efficient methods for the distance-based critical node detection problem in complex networks
• Exact identification of critical nodes in sparse networks via new compact formulations
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Hybrid constructive heuristics for the critical node problem
• Multilevel approaches for the critical node problem
• Online maximum \(k\)-coverage
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
• Solving the Distance-Based Critical Node Problem
• Statistical comparisons of classifiers over multiple data sets
• The bi-objective critical node detection problem
• TTT plots: a perl program to create time-to-target plots

Cited in

(1)

• Formulating opinion dynamics from belief formation, diffusion and updating in social network group decision-making: towards developing a holistic framework

This page was built for publication: A fast tri-individual memetic search approach for the distance-based critical node problem

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