Applications of a Special Polynomial Class of Tsp
Yugoslav journal of operations research, Tome 15 (2005) no. 1, p. 5
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
Keywords:
Partition problem, traveling salesman problem, pyramidal tours.
@article{YJOR_2005_15_1_a0,
author = {Jack Brimberg and Ephraim Korach and Mokhtar Amami},
title = {Applications of a {Special} {Polynomial} {Class} of {Tsp}},
journal = {Yugoslav journal of operations research},
pages = {5 },
year = {2005},
volume = {15},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2005_15_1_a0/}
}
Jack Brimberg; Ephraim Korach; Mokhtar Amami. Applications of a Special Polynomial Class of Tsp. Yugoslav journal of operations research, Tome 15 (2005) no. 1, p. 5 . http://geodesic.mathdoc.fr/item/YJOR_2005_15_1_a0/