The minimum cost network upgrade problem with maximum robustness to multiple node failures
From MaRDI portal
Publication:2669557
DOI10.1016/j.cor.2021.105453OpenAlexW3181675075MaRDI QIDQ2669557
Fábio Barbosa, Amaro de Sousa, Agostinho Agra
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105453
mixed integer linear programmingtelecommunicationsPareto frontierrobust network designcritical node detection
Related Items
Uses Software
Cites Work
- Unnamed Item
- Component-cardinality-constrained critical node problem in graphs
- Complexity of the critical node problem over trees
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- Detecting critical nodes in sparse graphs
- Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
- Improved formulations for minimum connectivity network interdiction problems
- The bi-objective critical node detection problem
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- Compact models for critical node detection in telecommunication networks
- The critical node detection problem in networks: a survey
- 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
- Exact identification of critical nodes in sparse networks via new compact formulations
- Emergence of Scaling in Random Networks
- A Greedy Heuristic for the Set-Covering Problem
- Collective dynamics of ‘small-world’ networks
- Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes
