New reformulations of distributionally robust shortest path problem
From MaRDI portal
(Redirected from Publication:342487)
Recommendations
- An approach to the distributionally robust shortest path problem
- Distributionally robust maximum probability shortest path problem
- Wasserstein distributionally robust shortest path problem
- Stochastic shortest path problem with delay excess penalty
- Algorithms and uncertainty sets for data-driven robust shortest path problems
Cites work
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- A note on two problems in connexion with graphs
- A polynomial-time algorithm to find shortest paths with recourse
- Constrained shortest path with uncertain transit times
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust stochastic knapsack problem
- Extended dominance and a stochastic shortest path problem
- Least expected time paths in stochastic, time-varying transportation networks
- Minimizing risk models in stochastic shortest path problems
- Network flows. Theory, algorithms, and applications.
- New models for the robust shortest path problem: complexity, resolution and generalization
- On a routing problem
- On duality theory of conic linear problems.
- On the robust shortest path problem.
- Optimal paths in probabilistic networks: A case with temporary preferences
- Recent advances in robust optimization: an overview
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Some NP-complete problems in quadratic and nonlinear programming
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Stochastic shortest path problems with recourse
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The sample average approximation method applied to stochastic routing problems: a computational study
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(8)- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- Recoverable robust shortest path problems
- Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity
- Stochastic shortest path problem with delay excess penalty
- An approach to the distributionally robust shortest path problem
- Distributionally robust maximum probability shortest path problem
- Wasserstein distributionally robust shortest path problem
- On the multistage shortest path problem under distributional uncertainty
This page was built for publication: New reformulations of distributionally robust shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342487)
