A polynomial-time algorithm to find shortest paths with recourse
From MaRDI portal
Recommendations
Cited in
(21)- Efficient, optimal stochastic-action selection when limited by an action budget
- Maximum probability shortest path problem
- Optimal information location for adaptive routing
- Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
- Network reliability: Heading out on the highway
- New reformulations of distributionally robust shortest path problem
- scientific article; zbMATH DE number 1875419 (Why is no real title available?)
- Bicriterion shortest paths in stochastic time-dependent networks
- Multicriteria adaptive paths in stochastic, time-varying networks
- On the online shortest path problem with limited arc cost dependencies
- Stochastic shortest paths with recourse
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- The reset disambiguation policy for navigating stochastic obstacle fields
- Finding a shortest even hole in polynomial time
- Optimal obstacle placement with disambiguations
- A Polynomial Time Algorithm for Bounded Directed Pathwidth
- Optimal guidance algorithms for parking search with reservations
- Stochastic shortest path problems with recourse
- Multicriteria stochastic shortest path problem for electric vehicles
- Penalty-based algorithms for the stochastic obstacle scene problem
- Joint chance constrained shortest path problem with Copula theory
This page was built for publication: A polynomial-time algorithm to find shortest paths with recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804170)
