The bi-objective critical node detection problem
From MaRDI portal
Publication:1681144
DOI10.1016/j.ejor.2017.08.053zbMath1374.90085OpenAlexW2753824835MaRDI QIDQ1681144
Kyle Robert Harrison, Beatrice M. Ombuki-Berman, Mario Ventresca
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.053
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (10)
Complexity of the multilevel critical node problem ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Analysis of cluster damages in network systems ⋮ Efficient heuristic algorithm for identifying critical nodes in planar networks ⋮ Analysis of critical damage in the communication network. III: Analysis of internode flows ⋮ The critical node detection problem in networks: a survey ⋮ Analysis of critical damage in the communication network. I: Model and computational experiment ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees
Uses Software
Cites Work
- Unnamed Item
- Identifying sets of key players in a social network
- Hybrid constructive heuristics for the critical node problem
- A derandomized approximation algorithm for the critical node detection problem
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Complexity of the critical node problem over trees
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Detecting critical nodes in sparse graphs
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- 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
- Exact identification of critical nodes in sparse networks via new compact formulations
- Cut problems in graphs with a budget constraint
- VNS solutions for the critical node problem
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Finding k Cuts within Twice the Optimal
- Complexity and approximability of the k‐way vertex cut
- Deception tactics for network interdiction: A multiobjective approach
- Selected Topics in Critical Element Detection
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: The bi-objective critical node detection problem
