Technical Note—Analysis of a Preference Order Traveling Salesman Problem

Moshe Sniedovich
Additional contact information
Moshe Sniedovich: National Research Institute for Mathematical Sciences, Pretoria, South Africa

Operations Research, 1981, vol. 29, issue 6, 1234-1237

Abstract: Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem. Although the procedure is flawed from the myopic interpretation of the monotonicity condition, it may be used as a convenient heuristic tool for solving stochastic problems.

Keywords: 111; preference; order; traveling; salesman; problem (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.6.1234 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:6:p:1234-1237

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().