The Traveling Salesman Location Problem on Stochastic Networks

Oded Berman and David Simchi-Levi
Additional contact information
Oded Berman: College of Management, The University of Massachusetts-Harbor Campus, Boston, Massachusetts 02125-3393
David Simchi-Levi: Columbia University, New York, New York 10027

Transportation Science, 1989, vol. 23, issue 1, 54-57

Abstract: In this note, we consider the traveling salesman location problem on stochastic networks in which the length of links are not deterministic. In particular, we show that several available solution methods for deterministic networks can be modified to solve the problem on stochastic networks as well.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.1.54 (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:ortrsc:v:23:y:1989:i:1:p:54-57

Access Statistics for this article

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