Sequential Shortest Path Interdiction with Incomplete Information
From MaRDI portal
Recommendations
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Sequential interdiction with incomplete information and learning
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Dynamic shortest-path interdiction
- Risk-averse shortest path interdiction
- On short paths interdiction problems: Total and node-wise limited interdiction
- Shortest path network interdiction with asymmetric information
- Shortest path interdiction problem with convex piecewise-linear costs
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- The Shortest Path Problem Under Partial Monitoring
Cites work
- Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
- Algorithms for network interdiction and fortification games
- An integer programming framework for critical elements detection in graphs
- An overview of bilevel optimization
- Asymptotically efficient adaptive allocation rules
- Combinatorial bandits
- Deterministic network interdiction
- Exact identification of critical nodes in sparse networks via new compact formulations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Finding the n Most Vital Links in Flow Networks
- Finding the n Most Vital Nodes in a Flow Network
- Finding the most vital arcs in a network
- Finite-time analysis of the multiarmed bandit problem
- Governments' and terrorists' defense and attack in a T-period game
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 2050723 (Why is no real title available?)
- Maximizing the minimum source-sink path subject to a budget constraint
- Minimizing a stochastic maximum-reliability path
- Modeling costly learning and counter-learning in a defender-attacker game with private defender information
- Modeling secrecy and deception in a multiple-period attacker-defender signaling game
- Most vital links and nodes in weighted networks
- Network flows. Theory, algorithms, and applications.
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Prediction, Learning, and Games
- Reformulation and sampling to solve a stochastic network interdiction problem
- Removing Arcs from a Network
- Robust adversarial risk analysis: a level-k approach
- Selected topics in critical element detection
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Some aspects of the sequential design of experiments
- Stochastic network interdiction
- The k most vital arcs in the shortest path problem
- The Nonstochastic Multiarmed Bandit Problem
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(28)- A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs
- The continuous maximum capacity path interdiction problem
- Network interdiction with asymmetric cost uncertainty
- A survey of network interdiction models and algorithms
- On the multistage shortest path problem under distributional uncertainty
- Risk-averse shortest path interdiction
- Shortest path network interdiction with asymmetric information
- Timely decision analysis enabled by efficient social media modeling
- Sequential interdiction with incomplete information and learning
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- On bilevel optimization with inexact follower
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- 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
- Shortest path interdiction problem with convex piecewise-linear costs
- A survey on bilevel optimization under uncertainty
- Interdicting restructuring networks with applications in illicit trafficking
- Two-stage nodal network interdiction under decision-dependent uncertainty
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- Shortest path network interdiction with incomplete information: a robust optimization approach
- Monte Carlo tree search for dynamic shortest-path interdiction
- Maximum likelihood probability measures over sets: existence, computation, and convergence
- Multi-stage network interdiction with decision-dependent success: scenario clustering and reformulation techniques
- Optimal sequential stochastic shortest path interdiction
- On supervalid inequalities for binary interdiction games
- Learning the follower's objective function in sequential bilevel games
- Data-driven interdiction with asymmetric cost uncertainty: a distributionally robust optimization approach
This page was built for publication: Sequential Shortest Path Interdiction with Incomplete Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4692013)
