An approach to the distributionally robust shortest path problem

DOI10.1016/j.cor.2021.105212OpenAlexW3119464194MaRDI QIDQ2668652

Oleg A. Prokopyev, Sergey S. Ketkov, Evgenii P. Burashnikov

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.08744

zbMATH Keywords

mixed-integer programmingshortest path problemdistributionally robust optimizationpolyhedral uncertainty

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

On the multistage shortest path problem under distributional uncertainty ⋮ Distributionally robust maximum probability shortest path problem

Uses Software

• ROME

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Distributionally robust mixed integer linear programs: persistency models with applications
• New reformulations of distributionally robust shortest path problem
• The computational complexity of the relative robust shortest path problem with interval data
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Stochastic programming approach to optimization under uncertainty
• Links between linear bilevel and mixed 0-1 programming problems
• On the robust shortest path problem.
• Robust discrete optimization and network flows
• $K$-adaptability in two-stage distributionally robust binary programming
• Robust optimization-methodology and applications
• The sample average approximation method applied to stochastic routing problems: a computational study
• An exact algorithm for the robust shortest path problem with interval data
• Two-stage combinatorial optimization problems under risk
• Wasserstein distributionally robust shortest path problem
• Regularized estimation of large covariance matrices
• Persistence in discrete optimization under data uncertainty
• Robust Convex Optimization
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Routing Optimization Under Uncertainty
• Distributionally Robust Convex Optimization
• Introduction to Stochastic Programming
• Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
• Distributionally Robust Optimization and Its Tractable Approximations
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Theory and Applications of Robust Optimization
• Integer Programming
• On a routing problem
• Lectures on Stochastic Programming
• An Analysis of Stochastic Shortest Path Problems
• The complexity of the network design problem
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• Shortest-path network interdiction
• The Value of Side Information in Shortest Path Optimization
• Robust solutions for network design under transportation cost and demand uncertainty
• Advanced Lectures on Machine Learning
• Shortest Path Problems with Resource Constraints

This page was built for publication: An approach to the distributionally robust shortest path problem