scientific article; zbMATH DE number 1808552

MaRDI QIDQ3149925zbMATH OpenFDO

Authors Amir Azaron, Farhad Kianfar

Publication date 12 March 2003

zbMATH Keywords

dynamic programmingMarkov processesstochastic processes

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic programming (90C15) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 4053318
• Finding the shortest path in stochastic networks
• scientific article; zbMATH DE number 786519
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Shortest paths in stochastic networks with correlated link costs
• scientific article; zbMATH DE number 956788
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 1783111
• Approximating the Stochastic Network by its M Shortest Paths

Cited in

(7)

• A directed hypergraph model for random time dependent shortest paths
• Dynamic shortest path in stochastic dynamic networks: Ship routing problem
• Finding shortest path in a combined exponential -- gamma probability distribution arc length
• Shortest paths in piecewise continuous time-dependent networks
• scientific article; zbMATH DE number 1783111 (Why is no real title available?)
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Stochastic shortest path with unlimited hops

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149925)