Shortest path network interdiction with asymmetric information
From MaRDI portal
Publication:3184598
DOI10.1002/net.20236zbMath1171.90345OpenAlexW4248338598MaRDI QIDQ3184598
Matthew D. Bailey, Halil Ibrahim Bayrak
Publication date: 21 October 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20236
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (30)
A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Network routing for insurgency: An adversarial risk analysis framework ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ Shortest path interdiction problem with convex piecewise-linear costs ⋮ A survey on bilevel optimization under uncertainty ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Network interdiction with asymmetric cost uncertainty ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ A computational approach to determine damage in infrastructure networks from outage reports ⋮ On a class of bilevel linear mixed-integer programs in adversarial settings ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ On the power of randomization in network interdiction ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ A survey of network interdiction models and algorithms ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback ⋮ Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
Cites Work
- Bilevel programming: a survey
- Convex two-level optimization
- Derivative evaluation and computational experience with large bilevel mathematical programs
- A penalty function approach for solving bi-level linear programs
- Descent approaches for quadratic bilevel programming
- Bilevel and multilevel programming: A bibliography review
- A global optimization method for solving convex quadratic bilevel programming problems
- Deterministic network interdiction
- Some two-echelon supply-chain games: Improving from deterministic-symmetric-information to stochastic-asymmetric-information models
- SPAR: Stochastic Programming with Adversarial Recourse
- Stochastic Network Interdiction
- Producer-Supplier Contracts with Incomplete Information
- A solution method for the static constrained Stackelberg problem via penalty method
- 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
- Two-Level Linear Programming
- Informational Size and Incentive Compatibility
- Removing Arcs from a Network
- Optimal interdiction of a supply network
This page was built for publication: Shortest path network interdiction with asymmetric information
