Journal ArticleDOI
Removing Arcs from a Network
Reads0
Chats0
TLDR
An algorithm for making a sensitivity analysis on a flow network, specifically, the problem of removing n arcs in a network such that the reduction in the maximum flow between an origin and destination node is maximized is proposed.Abstract:
This paper proposes an algorithm for making a sensitivity analysis on a flow network, specifically, the problem of removing n arcs in a network such that the reduction in the maximum flow between an origin and destination node is maximized. Such an algorithm might be helpful in determining how sensitive a transportation system is to having its roads closed for repairs.read more
Citations
More filters
Journal ArticleDOI
OR/MS Models for Supply Chain Disruptions: A Review
TL;DR: A review of the OR/MS literature on supply chain disruptions can be found in this paper, where the authors provide an overview of the research questions that have been addressed and a discussion of future research directions.
Journal ArticleDOI
Vulnerability and resilience of transport systems : A discussion of recent research
TL;DR: In this paper, the authors provide an overview of recent research on vulnerability and resilience of transport systems, and argue that more cross-disciplinary collaborations between authorities, operators and researchers would be desirable to transform this knowledge into practical strategies to strengthen the resilience of the transport system.
Journal ArticleDOI
Deterministic network interdiction
TL;DR: In this paper, the authors consider a network interdiction problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources.
Deterministic Network Interdiction
TL;DR: This paper considers a problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources.
Journal ArticleDOI
OR/MS models for supply chain disruptions: a review
TL;DR: In this article, the authors review the OR/MS literature on supply chain disruptions in order to take stock of the research to date and to provide an overview of research questio...
References
More filters
Book ChapterDOI
Maximal Flow Through a Network
L. R. Ford,D. R. Fulkerson +1 more
TL;DR: In this paper, the problem of finding a maximal flow from one given city to another is formulated as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link has a number assigned to it representing its capacity".
ReportDOI
A procedure for determining a family of minimum-cost network flow patterns
Robert G. Busacker,Paul J. Gowen +1 more
Journal ArticleDOI
Maximum Payloads Per Unit Time Delivered Through an Air Network
TL;DR: Two network algorithms are described that determine the route of maximum payload flow per hour of flight time and the maximum steady-state payload flow through a network with capacity constraints on the nodes.