A polynomial-time algorithm to find shortest paths with recourse

DOI10.1002/net.10063zbMath1028.90007OpenAlexW1982649161MaRDI QIDQ4804170

J. Scott Provan

Publication date: 10 April 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://cdr.lib.unc.edu/downloads/q811kt967

zbMATH Keywords

shortest pathstochastic networkrecourseDijkstradynamic shortest path

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items (15)

Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths ⋮ New reformulations of distributionally robust shortest path problem ⋮ Joint chance constrained shortest path problem with Copula theory ⋮ Network reliability: Heading out on the highway ⋮ Optimal obstacle placement with disambiguations ⋮ Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem ⋮ Optimal guidance algorithms for parking search with reservations ⋮ Maximum probability shortest path problem ⋮ The reset disambiguation policy for navigating stochastic obstacle fields ⋮ Optimal information location for adaptive routing ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Efficient, optimal stochastic-action selection when limited by an action budget ⋮ Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time algorithm to find shortest paths with recourse