Exact Algorithms for the Canadian Traveller Problem on Paths and Trees

The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more edge lengths) that minimizes the expected cost of travel. The problem is know...

全面介紹

書目詳細資料
Main Authors: Karger, David, Nikolova, Evdokia
其他作者: David Karger
出版: 2008
主題:
在線閱讀:http://hdl.handle.net/1721.1/40093