Robust and distributionally robust shortest path problems: a survey
From MaRDI portal
Cites work
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A note on two problems in connexion with graphs
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches
- A survey of adjustable robust optimization
- A survey of nonlinear robust optimization
- Abstract dynamic programming
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- An approach to the distributionally robust shortest path problem
- An enhanced exact procedure for the absolute robust shortest path problem
- An exact algorithm for the robust shortest path problem with interval data
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Arc routing under uncertainty: introduction and literature review
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally Robust Convex Optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Finding the K Shortest Loopless Paths in a Network
- Graph theory with applications
- Heuristic shortest path algorithms for transportation applications: state of the art
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 589271 (Why is no real title available?)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- Inequalities: theory of majorization and its applications
- Interval data minmax regret network optimization problems
- Network flows. Theory, algorithms, and applications.
- New models for the robust shortest path problem: complexity, resolution and generalization
- New reformulations of distributionally robust shortest path problem
- On an exact method for the constrained shortest path problem
- On the history of the shortest path problem
- On the multistage shortest path problem under distributional uncertainty
- On the robust shortest path problem.
- Recent advances in robust optimization: an overview
- Reduction approaches for robust shortest path problems
- Robust constrained shortest path problems under budgeted uncertainty
- Robust discrete optimization and network flows
- Robust optimization
- Robust shortest path planning and semicontractive dynamic programming
- Robust shortest path problems with two uncertain multiplicative cost coefficients
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Solving min-max shortest-path problems on a network
- The computational complexity of the relative robust shortest path problem with interval data
- The Price of Robustness
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The robust shortest path problem with interval data via Benders decomposition
- Variants of shortest path problems
- Wasserstein distributionally robust shortest path problem
This page was built for publication: Robust and distributionally robust shortest path problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931540)
