We consider shortest path problems defined on graphs with random are costs. We assume that information on are cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysis of some possible heuristic algorithms. (C) 1996 John Wiley & Sons, Inc.
机构:
Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
Hong Kong Polytech Univ, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R ChinaWuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
Chen, Bi Yu
Lam, William H. K.
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R ChinaWuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
Lam, William H. K.
Sumalee, Agachai
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R ChinaWuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
Sumalee, Agachai
Li, Qingquan
论文数: 0引用数: 0
h-index: 0
机构:
Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R ChinaWuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China
Li, Qingquan
Tam, Mei Lam
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Polytech Univ, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R ChinaWuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan 430079, Peoples R China