Computing shortest paths with uncertainty
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1962828
- Uncertain random shortest path problem
- Shortest path problem with uncertain arc lengths
- Finding reliable shortest paths in road networks under uncertainty
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Computing almost shortest paths
- Constrained shortest path with uncertain transit times
- Shortest path methods: A unifying approach
- scientific article; zbMATH DE number 7093019
- Finding the shortest path in stochastic networks
Cited in
(28)- Combinatorial optimization in system configuration design
- Scheduling with a processing time oracle
- Explorable uncertainty in scheduling with non-uniform testing times
- Two-stage robust optimization problems with two-stage uncertainty
- An adversarial model for scheduling with testing
- A robust optimization approach with probe-able uncertainty
- Optimal path discovery problem with homogeneous knowledge
- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Randomization helps computing a minimum spanning tree under uncertainty
- scientific article; zbMATH DE number 1962828 (Why is no real title available?)
- Algorithms for queryable uncertainty
- Scheduling with explorable uncertainty
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- Query-Competitive Sorting with Uncertainty.
- Computing shortest paths in the plane with removable obstacles
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Query minimization under stochastic uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- The power of amortization on scheduling with explorable uncertainty
- Shortest path problem with uncertain arc lengths
- The robust selection problem with information discovery
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- On the complexity of knapsack under explorable uncertainty: hardness and algorithms
- Scheduling with testing on multiple identical parallel machines
- Query-competitive algorithms for cheapest set problems under uncertainty
This page was built for publication: Computing shortest paths with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437091)
