Some Simple Applications of the Travelling Salesman Problem

By J. Lenstra, A. Kan. 1975

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning (2019, methodology): “Hence, proposed heuristics to solve TSP (Lenstra and Kan, 1975; Bonomi and Lutton, 1984) can be used to construct the chain in our problem with the aid of a central entity, and then”
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex (2000, background): “The MTSP arising can be transformed to a single TSP following Lenstra and Rinnooy Kan [20].”
The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths from TSP-Optimality (2008, unknown): “…substantially from the TSP solution are associated with larger shopping baskets; (3) order deviation is strongly associated with purchase behavior, while travel deviation is not; and (4) shoppers with paths closer to the TSP solution tend to buy more from frequently purchased product categories.”
The multiple traveling salesman problem: an overview of formulations and solution procedures (2006, background): “Lenstra and Rinnooy Kan[9] describe two similar applications, where the first application consists of finding the routes of a technical crew, which has to visit telephone boxes in North Holland.”