Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
From MaRDI portal
Publication:5868922
DOI10.1287/deca.2021.0426OpenAlexW3195038039MaRDI QIDQ5868922
Denis Sauré, Oleg A. Prokopyev, Juan S. Borrero, Jing Yang
Publication date: 26 September 2022
Published in: Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/deca.2021.0426
Related Items (5)
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ 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
Cites Work
- Modeling costly learning and counter-learning in a defender-attacker game with private defender information
- Evader interdiction: algorithms, complexity and collateral damage
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Stochastic orders
- Leadership games with convex strategy sets
- On lower bounds for tail probabilities
- Modeling secrecy and deception in a multiple-period attacker-defender signaling game
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Links between linear bilevel and mixed 0-1 programming problems
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- A note on linearized reformulations for a class of bilevel linear integer problems
- Finding the most vital arcs in a network
- Robust combinatorial optimization with variable budgeted uncertainty
- A survey of network interdiction models and algorithms
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Risk-Averse Shortest Path Interdiction
- Shortest path network interdiction with asymmetric information
- Maximizing the minimum source-sink path subject to a budget constraint
- Dynamic shortest‐path interdiction
- Deception tactics for network interdiction: A multiobjective approach
- Governments' and Terrorists' Defense and Attack in a T-Period Game
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Sequential Interdiction with Incomplete Information and Learning
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Collective dynamics of ‘small-world’ networks
- Prediction, Learning, and Games
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
