The Traveling Salesman Location Problem on Stochastic Networks

Published Online:https://doi.org/10.1287/trsc.23.1.54

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.