Improved formulations for minimum connectivity network interdiction problems
type: Item
instance of: scholarly article
title: Improved formulations for minimum connectivity network interdiction problems
zbMATH Open document ID: 1391.90122
author: Konstantin Pavlikov
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6901636
zbMATH Keywords: network connectivity
zbMATH Keywords: network interdiction
zbMATH Keywords: mixed integer linear programming
describes a project that uses: Gurobi
describes a project that uses: NetworkX
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
OpenAlex ID: W2802091848
cites work: Detecting critical nodes in sparse graphs
cites work: Identifying sets of key players in a social network
cites work: The university of Florida sparse matrix collection
cites work: Complexity of the critical node problem over trees
cites work: Finding the k shortest simple paths
cites work: Disconnecting graphs by removing vertices: a polyhedral approach
cites work: Enumerating all simple paths in a graph
cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Exact identification of critical nodes in sparse networks via new compact formulations
cites work: An integer programming framework for critical elements detection in graphs
Wikidata QID: Q129977008
DOI: 10.1016/J.COR.2018.04.012
description: scientific article; zbMATH DE number 6901636