Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
From MaRDI portal
Recommendations
- Sequential Shortest Path Interdiction with Incomplete Information
- Sequential interdiction with incomplete information and learning
- Risk-averse shortest path interdiction
- Dynamic shortest-path interdiction
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Shortest path network interdiction with asymmetric information
- On short paths interdiction problems: Total and node-wise limited interdiction
- scientific article; zbMATH DE number 1944081
- Shortest path interdiction problem with convex piecewise-linear costs
- scientific article; zbMATH DE number 5121085
Cites work
- A note on linearized reformulations for a class of bilevel linear integer problems
- A survey of network interdiction models and algorithms
- Collective dynamics of `small-world' networks
- Deception tactics for network interdiction: a multiobjective approach
- Dynamic shortest-path interdiction
- Evader interdiction: algorithms, complexity and collateral damage
- Finding the most vital arcs in a network
- Governments' and terrorists' defense and attack in a T-period game
- scientific article; zbMATH DE number 1693470 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- Leadership games with convex strategy sets
- Links between linear bilevel and mixed 0-1 programming problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Modeling costly learning and counter-learning in a defender-attacker game with private defender information
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- 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.
- On lower bounds for tail probabilities
- On the robust shortest path problem.
- Prediction, Learning, and Games
- Risk-averse shortest path interdiction
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust discrete optimization and network flows
- Sequential interdiction with incomplete information and learning
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Stochastic orders
- The k most vital arcs in the shortest path problem
Cited in
(11)- Exact solution approaches for a class of bilevel fractional programs
- Risk-averse shortest path interdiction
- Sequential Shortest Path Interdiction with Incomplete Information
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- 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
- Maximum likelihood probability measures over sets: existence, computation, and convergence
- Optimal sequential stochastic shortest path interdiction
- On supervalid inequalities for binary interdiction games
- Learning the follower's objective function in sequential bilevel games
This page was built for publication: Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868922)
