Exact interdiction models and algorithms for disconnecting networks via node deletions
type: Item
instance of: scholarly article
title: Exact interdiction models and algorithms for disconnecting networks via node deletions
zbMATH Open document ID: 1254.90280
author: Siqian Shen
author: J. Cole Smith
author: Roshan Goli
published in: Discrete Optimization
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6119005
zbMATH Keywords: network interdiction
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: valid inequalities
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.disopt.2012.07.001
OpenAlex ID: W2120686390
cites work: Q5395365
cites work: Identifying sets of key players in a social network
cites work: Epidemic dynamics on complex networks
cites work: OR FORUM—Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher
cites work: Collective dynamics of ‘small-world’ networks
cites work: Detecting critical nodes in sparse graphs
cites work: Stochastic network interdiction
cites work: Survivable network design under optimal and heuristic interdiction scenarios
cites work: Q3528714
cites work: Deterministic network interdiction
cites work: Complexity of the critical node problem over trees
cites work: Design of Survivable Networks: A survey
cites work: Node-and edge-deletion NP-complete problems
cites work: Q3056948
cites work: Q4198056
cites work: Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
DOI: 10.1016/J.DISOPT.2012.07.001
description: scientific article; zbMATH DE number 6119005