Exact identification of critical nodes in sparse networks via new compact formulations
From MaRDI portal
Publication:2448196
DOI10.1007/s11590-013-0666-xzbMath1292.90260OpenAlexW2001711833MaRDI QIDQ2448196
Alexander Veremyev, Eduardo L. Pasiliao, Vladimir L. Boginski
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0666-x
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (32)
Hybrid constructive heuristics for the critical node problem ⋮ Minimum cost edge blocker clique problem ⋮ Exact algorithms for the minimum cost vertex blocker clique problem ⋮ Improved formulations for minimum connectivity network interdiction problems ⋮ Methods for removing links in a network to minimize the spread of infections ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Solving the Distance-Based Critical Node Problem ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ The bi-objective critical node detection problem ⋮ Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes ⋮ Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks ⋮ Bound and exact methods for assessing link vulnerability in complex networks ⋮ An integer programming framework for critical elements detection in graphs ⋮ The stochastic critical node problem over trees ⋮ On designing networks resilient to clique blockers ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Vulnerability analysis of interdependent network via integer programming approaches ⋮ Compact models for critical node detection in telecommunication networks ⋮ Critical node identification for complex network based on a novel minimum connected dominating set ⋮ The critical node detection problem in networks: a survey ⋮ An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections ⋮ Optimal detection of critical nodes: improvements to model structure and performance ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
Uses Software
Cites Work
- Identifying sets of key players in a social network
- Detecting critical nodes in sparse graphs
- 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
- The university of Florida sparse matrix collection
- Cardinality-Constrained Critical Node Detection Problem
- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
This page was built for publication: Exact identification of critical nodes in sparse networks via new compact formulations
