Optimal sequential stochastic shortest path interdiction

DOI10.1016/J.EJOR.2025.04.009MaRDI QIDQ6921909zbMATH OpenFDO

Authors Juan S. Borrero, Denis Sauré, Natalia Trigo

Publication date 6 October 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.04.009

zbMATH Keywords

combinatorial optimizationmulti-armed banditsnetwork interdictionOR in defence

Mathematics Subject Classification ID

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

Cites work

• 10.1162/153244303321897663
• X-armed bandits
• A survey of network interdiction models and algorithms
• Asymptotically efficient adaptive allocation rules
• Combinatorial bandits
• Deterministic network interdiction
• Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
• Dynamic shortest-path interdiction
• Finding the most vital arcs in a network
• Finite-time analysis of the multiarmed bandit problem
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3638998 (Why is no real title available?)
• scientific article; zbMATH DE number 2050723 (Why is no real title available?)
• scientific article; zbMATH DE number 5485582 (Why is no real title available?)
• Information collection on a graph
• Interdicting restructuring networks with applications in illicit trafficking
• Julia: a fresh approach to numerical computing
• Learning in combinatorial optimization: what and how to explore
• Learning to optimize via posterior sampling
• Linearly parameterized bandits
• Maximizing the minimum source-sink path subject to a budget constraint
• Network interdiction with asymmetric cost uncertainty
• On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
• Optimal interdiction of a supply network
• Optimal interdiction policy for a flow network
• Prediction, Learning, and Games
• Regret in online combinatorial optimization
• Sequential interdiction with incomplete information and learning
• Sequential Shortest Path Interdiction with Incomplete Information
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
• Shortest path network interdiction with asymmetric information
• Shortest path network interdiction with incomplete information: a robust optimization approach
• Shortest-path network interdiction
• Solving multi-period interdiction via generalized Bender's decomposition
• Some aspects of the sequential design of experiments
• Stochastic network interdiction
• The k most vital arcs in the shortest path problem
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems
• Uncertain linear programs: extended affinely adjustable robust counterparts

Cited in

(2)

• Maximum likelihood probability measures over sets: existence, computation, and convergence
• Vehicle scheduling network interdiction problem with fortification: an application to cyber security planning

This page was built for publication: Optimal sequential stochastic shortest path interdiction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921909)