Stochastic shortest path with unlimited hops
- 1 February 2009
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 109 (5) , 290-295
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The dynamic shortest path problem with anticipationEuropean Journal of Operational Research, 2007
- Stochastic Shortest Paths Via Quasi-convex Maximization2006
- Arriving on TimeJournal of Optimization Theory and Applications, 2005
- Shortest paths in stochastic networks with correlated link costsComputers & Mathematics with Applications, 2005
- Signal flow graphs for path enumeration and deflection routing analysis in multihop networks2003
- On the online shortest path problem with limited arc cost dependenciesNetworks, 2002
- Burst optical deflection routing protocol for wavelength routing WDM networks2000
- Expected shortest paths in dynamic and stochastic traffic networksTransportation Research Part B: Methodological, 1998