Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

DOI10.1016/j.cor.2012.02.008zbMath1251.90342OpenAlexW2050675408MaRDI QIDQ1761226

Mario Ventresca

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.008

zbMATH Keywords

simulated annealingrandom graphcomplex networkscritical node detectionpopulation-based incremental learning

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (26)

Hybrid constructive heuristics for the critical node problem ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ VNS solutions for the critical node problem ⋮ A genetic algorithm for a class of critical node problems ⋮ A derandomized approximation algorithm for the critical node detection problem ⋮ A randomized algorithm with local search for containment of pandemic disease spread ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ The bi-objective critical node detection problem ⋮ The connected critical node problem ⋮ Critical node/edge detection problems on trees ⋮ A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem ⋮ An integer programming framework for critical elements detection in graphs ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Exact identification of critical nodes in sparse networks via new compact formulations ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ A compact mixed integer linear formulation for safe set problems ⋮ Efficient heuristic algorithm for identifying critical nodes in planar networks ⋮ The critical node detection problem in networks: a survey ⋮ Parameterized complexity of critical node cuts ⋮ Literature review: the vaccine supply chain ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

Uses Software

• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• A calculus for the random generation of labelled combinatorial structures
• Ranking and unranking permutations in linear time
• Evolution of the social network of scientific collaborations
• Efficient immunization strategies on complex networks
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Cardinality-Constrained Critical Node Detection Problem
• Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
• Emergence of Scaling in Random Networks
• A random graph model for massive graphs
• Handbook of Applied Algorithms
• A comparison of simulated annealing cooling strategies
• Parallel Processing and Applied Mathematics
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem