Stochastic shortest path problems with recourse
From MaRDI portal
DOI10.1002/(SICI)1097-0037(199603)27:2%3C133::AID-NET5%3E3.0.CO;2-LzbMATH Open0851.90129OpenAlexW2039114216MaRDI QIDQ4887743FDOQ4887743
Authors: George H. Polychronopoulos, John N. Tsitsiklis 
Publication date: 5 August 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199603)27:2%3C133::aid-net5%3E3.0.co;2-l
Recommendations
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Stochastic programming (90C15)
Cited In (50)
- The Shortest Path Problem Under Partial Monitoring
- Linear programming formulation for strategic dynamic traffic assignment
- Efficient, optimal stochastic-action selection when limited by an action budget
- The global optimal algorithm of reliable path finding problem based on backtracking method
- Least expected time paths in stochastic schedule-based transit networks
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Optimal information location for adaptive routing
- The reset disambiguation policy for navigating stochastic obstacle fields
- Stochastic shortest path with unlimited hops
- Stochastic shortest path problems with associative accumulative criteria
- User equilibrium with recourse
- A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand
- Models and algorithm for stochastic shortest path problem
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Arrival time dependent routing policies in public transport
- Stochastic shortest path problem with delay excess penalty
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
- Dynamic journeying under uncertainty
- Approximation and complexity of multi-target graph search and the Canadian traveler problem
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
- Robust path choice in networks with failures
- Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets
- The stochastic shortest path problem: a polyhedral combinatorics perspective
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
- A polynomial-time algorithm to find shortest paths with recourse
- Randomized Shortest-Path Problems: Two Related Models
- Title not available (Why is that?)
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
- PH-graphs for analyzing shortest path problems with correlated traveling times
- A directed hypergraph model for random time dependent shortest paths
- Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network
- New reformulations of distributionally robust shortest path problem
- Constrained shortest path with uncertain transit times
- The dynamic shortest path problem with anticipation
- Joint chance constrained shortest path problem with Copula theory
- Technical Note—A Note on the Stochastic Shortest Route Problem
- Maximum probability shortest path problem
- A note on detecting unbounded instances of the online shortest path problem
- Risk-averse shortest path interdiction
- Stochastic shortest paths with recourse
- Online learning of energy consumption for navigation of electric vehicles
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Label-setting methods for multimode stochastic shortest path problems on graphs
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
- Multicriteria adaptive paths in stochastic, time-varying networks
- Complexity of Canadian traveler problem variants
- On the online shortest path problem with limited arc cost dependencies
- A new approach to determine the critical path in stochastic activity network
This page was built for publication: Stochastic shortest path problems with recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887743)
