Finding the most vital arcs in a network

Authors:
Michael O. Ball;Bruce L. Golden;Rakesh V. Vohra
Affiliations:
College of Business and Management, University of Maryland, College Park, MD 20742, USA;College of Business and Management, University of Maryland, College Park, MD 20742, USA;Faculty of Management Sciences, Ohio State University, Columbus, OH 43210, USA
Venue:
Operations Research Letters
Year:
1989

Citing 2
Cited 7

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Most vital links and nodes in weighted networks

Operations Research Letters

Decision support for network disruption mitigation

Decision Support Systems
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Computers and Operations Research
Matching interdiction

Discrete Applied Mathematics
The k most vital arcs in the shortest path problem

Operations Research Letters
Finding Alternative Shortest Paths in Spatial Networks

ACM Transactions on Database Systems (TODS)
Maximum dynamic network flow interdiction problem: New formulation and solution procedures

Computers and Industrial Engineering
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let N = (V, A) be a directed, arc weighted network with node set V and arc set A. Associated with each arc e@eA is a non-negative distance d(e) and a non-negative cost c(e) of removing it from N. Let B be the total amount available to spend on removing arcs. The most vital arcs problem (MVAP) is the problem of finding a subset K of arcs such that @S"e"@e"Kc(e) =