An approach to the distributionally robust shortest path problem

DOI10.1016/J.COR.2021.105212OpenAlexW3119464194MaRDI QIDQ2668652FDOQ2668652

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

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

zbMATH Keywords

shortest path problemmixed-integer programmingdistributionally robust optimizationpolyhedral uncertainty

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

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

Cited In (17)

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

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)