An approach to the distributionally robust shortest path problem

DOI10.1016/J.COR.2021.105212MaRDI QIDQ2668652OpenAlexFDO

Authors Sergey S. Ketkov, Oleg A. Prokopyev, 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

shortest path problemmixed-integer programmingdistributionally robust optimizationpolyhedral uncertainty

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• New reformulations of distributionally robust shortest path problem
• Wasserstein distributionally robust shortest path problem
• On the multistage shortest path problem under distributional uncertainty
• On the robust shortest path problem.
• Distributionally robust maximum probability shortest path problem

Cites work

• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 2119080 (Why is no real title available?)
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• $K$-adaptability in two-stage distributionally robust binary programming
• A note on two problems in connexion with graphs
• A suggested computation for maximal multi-commodity network flows
• Advanced Lectures on Machine Learning
• An Analysis of Stochastic Shortest Path Problems
• An exact algorithm for the robust shortest path problem with interval data
• Distributionally Robust Convex Optimization
• Distributionally robust mixed integer linear programs: persistency models with applications
• Distributionally robust optimization and its tractable approximations
• Distributionally robust optimization under moment uncertainty with application to data-driven problems
• Integer Programming
• Introduction to stochastic programming.
• Least expected time paths in stochastic, time-varying transportation networks
• Lectures on Stochastic Programming
• Links between linear bilevel and mixed 0-1 programming problems
• Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
• Network flows. Theory, algorithms, and applications.
• New reformulations of distributionally robust shortest path problem
• On a routing problem
• On duality theory of conic linear problems.
• On the robust shortest path problem.
• Persistence in discrete optimization under data uncertainty
• Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
• Regularized estimation of large covariance matrices
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Robust convex optimization
• Robust discrete optimization and network flows
• Robust optimization
• Robust optimization-methodology and applications
• Robust solutions for network design under transportation cost and demand uncertainty
• Routing optimization under uncertainty
• Shortest Path Problems with Resource Constraints
• Shortest-path network interdiction
• Stochastic programming approach to optimization under uncertainty
• The Value of Side Information in Shortest Path Optimization
• The complexity of the network design problem
• The computational complexity of the relative robust shortest path problem with interval data
• The sample average approximation method applied to stochastic routing problems: a computational study
• Theory and applications of robust optimization
• Two-stage combinatorial optimization problems under risk
• Wasserstein distributionally robust shortest path problem

Cited in

(17)

• Robust shortest path planning and semicontractive dynamic programming
• The \(\alpha\)-reliable shortest path problem
• New reformulations of distributionally robust shortest path problem
• Robust adaptive routing under uncertainty
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
• Robust constrained shortest path problems under budgeted uncertainty
• An approach to the distributionally robust shortest path problem
• On the robust shortest path problem.
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Risk averse shortest paths: a computational study
• Distributionally robust maximum probability shortest path problem
• Wasserstein distributionally robust shortest path problem
• On the multistage shortest path problem under distributional uncertainty
• Recoverable robust shortest path problems
• Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
• An exact algorithm for the robust shortest path problem with interval data

Describes a project that uses

Uses Software

• ROME

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

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