Improved formulations for minimum connectivity network interdiction problems
From MaRDI portal
Publication:1652701
DOI10.1016/j.cor.2018.04.012zbMath1391.90122OpenAlexW2802091848WikidataQ129977008 ScholiaQ129977008MaRDI QIDQ1652701
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://portal.findresearcher.sdu.dk/da/publications/9f374157-bd9e-4662-89d0-1f6f0a36c99f
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (6)
Complexity of the multilevel critical node problem ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures ⋮ The stochastic critical node problem over trees ⋮ On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions ⋮ Critical nodes in interdependent networks with deterministic and probabilistic cascading failures ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem
Uses Software
Cites Work
- Identifying sets of key players in a social network
- An integer programming framework for critical elements detection in graphs
- Complexity of the critical node problem over trees
- Detecting critical nodes in sparse graphs
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exact identification of critical nodes in sparse networks via new compact formulations
- The university of Florida sparse matrix collection
- Enumerating all simple paths in a graph
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Finding the k shortest simple paths
- Disconnecting graphs by removing vertices: a polyhedral approach
This page was built for publication: Improved formulations for minimum connectivity network interdiction problems
