Applications of a special polynomial class of TSP

Jack Brimberg; Ephraim Korach; Mokhtar Amami

doi:10.2298/YJOR0501005B

Applications of a special polynomial class of TSP

Jack Brimberg, Ephraim Korach, Mokhtar Amami

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	5-14
Number of pages	10
Journal	Yugoslav Journal of Operations Research
Volume	15
Issue number	1
DOIs	https://doi.org/10.2298/YJOR0501005B
State	Published - 1 Jan 2005

Keywords

Partition problem
Pyramidal tours
Traveling salesman problem

ASJC Scopus subject areas

Management Science and Operations Research

Access to Document

10.2298/YJOR0501005B

Cite this

@article{ab3730b4b7904f32a728d7cf8abead4e,

title = "Applications of a special polynomial class of TSP",

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.",

keywords = "Partition problem, Pyramidal tours, Traveling salesman problem",

author = "Jack Brimberg and Ephraim Korach and Mokhtar Amami",

note = "Publisher Copyright: {\textcopyright} 2005 Yugoslav Journal of Operations Research.",

year = "2005",

month = jan,

day = "1",

doi = "10.2298/YJOR0501005B",

language = "English",

volume = "15",

pages = "5--14",

journal = "Yugoslav Journal of Operations Research",

issn = "0354-0243",

publisher = "University of Belgrade",

number = "1",

}

TY - JOUR

T1 - Applications of a special polynomial class of TSP

AU - Brimberg, Jack

AU - Korach, Ephraim

AU - Amami, Mokhtar

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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.

AB - 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.

KW - Partition problem

KW - Pyramidal tours

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=84941961275&partnerID=8YFLogxK

U2 - 10.2298/YJOR0501005B

DO - 10.2298/YJOR0501005B

M3 - Article

AN - SCOPUS:84941961275

SN - 0354-0243

VL - 15

SP - 5

EP - 14

JO - Yugoslav Journal of Operations Research

JF - Yugoslav Journal of Operations Research

IS - 1

ER -

Applications of a special polynomial class of TSP

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this