Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
From MaRDI portal
Publication:1761829
DOI10.1007/s10479-012-1135-0zbMath1259.91061MaRDI QIDQ1761829
Hanif D. Sherali, Brian J. Lunday
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1135-0
resource allocation; synergy; network interdiction; minimax flow problems; network evasion; overt and covert strategies
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Foundations of bilevel programming
- Deterministic network interdiction
- SPAR: Stochastic Programming with Adversarial Recourse
- Stochastic Network Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Interdicting a Nuclear-Weapons Project
- Shortest path network interdiction with asymmetric information
- Maximal Flow Through a Network
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Environmental and Cost Synergy in Supply Chain Network Integration in Mergers and Acquisitions
- Search and Its Optimization
- Optimal Search for a Moving Target in Discrete Time and Space
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- Nonlinear Programming
