Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times

Elsevier Science Bv
Publication Type:
Journal Article
European Journal Of Operational Research, 2008, 190 (2), pp. 383 - 397
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008000139.pdf274.98 kB
Adobe PDF
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a non-uniform amount of time travelling from one region to another before being able to search it for the
Please use this identifier to cite or link to this item: