Article ID: | iaor1989624 |
Country: | United States |
Volume: | 23 |
Issue: | 3 |
Start Page Number: | 184 |
End Page Number: | 191 |
Publication Date: | Aug 1989 |
Journal: | Transportation Science |
Authors: | Bertsimas Dimitris J. |
Keywords: | location, programming: travelling salesman |
We consider two generic facility location problems, the traveling salesman facility location problem (TSFLP) and the probabilistic traveling salesman facility location problem (PTSFLP), both of which have been a subject of intensive investigation recently. Concerning the TSFLP, we first improve the worst-case bound of the best-known heuristic for the problem on networks and observe that it is optimal under the triangle inequality to locate the facility at a node, which always requires a visit. Concerning the PTSFLP, we reduce it to the solution of