Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Berman et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: