Applications of a special polynomial class of TSP

Jack Brimberg, Ephraim Korach, Mokhtar Amami

Research output: Contribution to journalArticlepeer-review

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 NPhard. However, a sub problem may be solved as a special class of TSP in O (N log N) time. Several applications are noted.

Original languageEnglish
Pages (from-to)5-14
Number of pages10
JournalYugoslav Journal of Operations Research
Volume15
Issue number1
DOIs
StatePublished - 1 Jan 2005

Keywords

  • Partition problem
  • Pyramidal tours
  • Traveling salesman problem

Fingerprint

Dive into the research topics of 'Applications of a special polynomial class of TSP'. Together they form a unique fingerprint.

Cite this