Applications of a special polynomial class of TSP

Applications of a special polynomial class of TSP

0.00 Avg rating—0 Votes
Article ID: iaor20053340
Country: Serbia
Volume: 15
Issue: 1
Start Page Number: 5
End Page Number: 14
Publication Date: Jan 2005
Journal: Yugoslav Journal of Operations Research
Authors: , ,
Keywords: search, game theory
Abstract:

A hypothetical problem which we call a “buried treasure problem” is presented where the objective is to locate m objects among N fixed equi-spaced caches in order to minimize a measure of the risk of loss. The general problem is shown to be NP-hard. However, a sub problem may be solved as a special class of TSP in O(N log N) time. Several applications are noted.

Reviews

Required fields are marked *. Your email address will not be published.