Network interdiction to minimize the maximum probability of evasion with synergy between applied resources

DOI10.1007/S10479-012-1135-0MaRDI QIDQ1761829zbMATH OpenOpenAlexFDO

Authors Brian J. Lunday, Hanif D. Sherali

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

zbMATH Keywords

resource allocationsynergynetwork interdictionminimax flow problemsnetwork evasionovert and covert strategies

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• A dynamic network interdiction problem
• Network interdiction with asymmetric cost uncertainty
• Optimal Interdiction of Unreactive Markovian Evaders
• Two-Person Zero-Sum Games for Network Interdiction
• Evader interdiction: algorithms, complexity and collateral damage

Cites work

• scientific article; zbMATH DE number 2050720 (Why is no real title available?)
• scientific article; zbMATH DE number 2050723 (Why is no real title available?)
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• A decomposition algorithm applied to planning the interdiction of stochastic networks
• A dynamic network interdiction problem
• A problem in network interdiction
• Algorithms for network interdiction and fortification games
• Deterministic network interdiction
• Environmental and cost synergy in supply chain network integration in mergers and acquisitions
• Foundations of bilevel programming
• Interdicting a Nuclear-Weapons Project
• Maximal Flow Through a Network
• Maximizing the minimum source-sink path subject to a budget constraint
• Nonlinear Programming
• Optimal Search for a Moving Target in Discrete Time and Space
• SPAR: Stochastic Programming with Adversarial Recourse
• Search and Its Optimization
• Shortest path network interdiction with asymmetric information
• Shortest-path network interdiction
• Solving the bi-objective maximum-flow network-interdiction problem
• Stochastic network interdiction
• Two-Person Zero-Sum Games for Network Interdiction

Cited in

(7)

• Evader interdiction: algorithms, complexity and collateral damage
• A survey on bilevel optimization under uncertainty
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• A two‐stage network interdiction‐monitoring game
• Network interdiction with asymmetric cost uncertainty
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption

This page was built for publication: Network interdiction to minimize the maximum probability of evasion with synergy between applied resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761829)