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.
read more
About: This article is published in Mathematical and Computer Modelling. The article was published on 21 Jan 1993. and is currently open access. The article focuses on the topics: Flow network & Interdiction.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Defending Critical Infrastructure
TL;DR: New bilevel and trilevel optimization models to make critical infrastructure more resilient against terrorist attacks are applied and insights gained from the modeling experience and many “red-team” exercises are reported.
Shortest‐path network interdiction
Eitan Israeli,R. Kevin Wood +1 more
TL;DR: Computational results demonstrate orders‐of‐magnitude improvements of the decomposition algorithms over direct solution of the MIP and show that SVIs also help solve the original MIP faster.
Stochastic Network Interdiction
TL;DR: A stochastic version of the interdictor's problem: Minimize the expected maximum flow through the network when interdiction successes are binary random variables is formulated and solved.
401
Planning for Disruptions in Supply Chain Networks
Lawrence V. Snyder,Maria Paola Scaparra,Mark S. Daskin,Richard L. Church +3 more
- 01 Jan 2006
TL;DR: In this paper, the authors present a broad range of models for designing supply chains resilient to disruptions, and divide them based on the underlying optimization model (facility location or network design) and the risk measure (expected cost or worst-case cost).
317
Protecting Critical Assets: The r-interdiction median problem with fortification
TL;DR: A new integer-linear programming model is presented that optimally allocates fortification resources in order to minimize the impact of interdiction and demonstrates that the presence of fortification can impact which system elements are considered critical.
References
•Book
Integer and Combinatorial Optimization
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1988
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Solving Large-Scale Zero-One Linear Programming Problems
TL;DR: The results indicate that cutting-planes related to the facets of the underlying polytope are an indispensable tool for the exact solution of this class of problem.
735
Edmonds polytopes and a hierarchy of combinatorial problems
TL;DR: It is proved that there is no upper bound on the rank of problems arising from the search for largest independent sets in graphs.
680
Facets of the knapsack polytope
TL;DR: A necessary and sufficient condition is given for an inequality with coefficients 0 or 1 to define a facet of the knapsack polytope, i.e., of the convex hull of 0–1 points satisfying a given linear inequality.
450