On the power of randomization in network interdiction

DOI10.1016/j.orl.2015.11.005zbMath1408.91038arXiv1312.3478OpenAlexW1738845896MaRDI QIDQ1785482

James B. Orlin, Ebrahim Nasrabadi, Dimitris J. Bertsimas

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3478

zbMATH Keywords

game theoryapproximationnetwork flowsinterdiction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (14)

Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Network Inspection for Detecting Strategic Attacks ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Decomposition of probability marginals for security games in abstract networks ⋮ A two‐stage network interdiction‐monitoring game ⋮ Rerouting Flows when Links Fail ⋮ A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay ⋮ Protection of flows under targeted attacks ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ The complexity of computing a robust flow ⋮ Robust Randomized Matchings ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Bi-objective optimization models for network interdiction

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic network interdiction
• Stochastic Network Interdiction
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Reformulation and sampling to solve a stochastic network interdiction problem
• Shortest path network interdiction with asymmetric information
• Finding the n Most Vital Links in Flow Networks
• Maximizing residual flow under an arc destruction
• Shortest-path network interdiction
• Robust and Adaptive Network Flows
• The network inhibition problem
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• Removing Arcs from a Network

This page was built for publication: On the power of randomization in network interdiction