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

DOI10.1007/S10479-012-1135-0zbMATH Open1259.91061OpenAlexW2171727524MaRDI QIDQ1761829FDOQ1761829

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

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

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)

Cites Work

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

Cited In (7)

• A survey on bilevel optimization under uncertainty
• Evader interdiction: algorithms, complexity and collateral damage
• 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)