The traveling salesman problem and its variations

By Gregory Z. Gutin, Abraham P. Punnen. 2007

1,344 citations recorded by the source corpus.

Subfields: Automotive Engineering, Industrial and Manufacturing Engineering, Signal Processing

View Paper: https://www.semanticscholar.org/paper/036b9f1dd4b944a37a2907ac9a7cafb33176863b

How researchers see this paper

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

In Automotive Engineering

In Industrial and Manufacturing Engineering

In Signal Processing

Citations in the corpus

The Algorithm Design Manual (2020, background): “Gutin and Punnen [GP07] now offer the best reference on all aspects and variations of the traveling salesman problem, displacing an older but beloved book by Lawler et al. [LLKS85].”
Learning Improvement Heuristics for Solving Routing Problems (2019, methodology): “We generate the instances following [17], [23], where the coordinates of each node are randomly sampled in the unit square [0, 1] × [0, 1], with a uniform distribution.”
Traveling Salesman Problems with Profits (2005, background): “Traveling Salesman Problems With Profits DOMINIQUE FEILLET Laboratoire d’Informatique d’Avignon, 339 Chemin des Meinajariés, BP 1228, 84000 Avignon, France dominique.feillet@lia.univ-avignon.fr PIERRE DEJAX Ecole des Mines de Nantes and IRCCyN, 4, rue Alfred Kastler, 44307 Nantes, France Pierre.Dej”
On the Min-cost Traveling Salesman Problem with Drone (2015, background): “In this way, the problem can be favourably transformed to a Generalized Traveling Salesman Problem (GTSP) [21].”
An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits (2009, background): “1 Problem description Among the multiple variants of the TSP [14], the TSPP belongs to the selective TSP class where a feasible solution is not required to visit all vertices.”
The vehicle routing problem: State of the art classification and review (2016, background): “Note that the single vehicle case is commonly referred to as the Traveling Salesman Problem (TSP), for which in itself an extensive amount of literature is available (see e.g., Applegate, Bixby, Chvatal, & Cook, 2011; Gutin & Punnen, 2007; Lawler, Lenstra, Rinnooy Kan, & Shmoys, 1985).”
Throughput-Optimal Topology Design for Cross-Silo Federated Learning (2020, background): “Finding the optimal tour in a complete graph is a well known problem and is referred to as the Traveling Salesman Problem (TSP), see for example [4].”
General k-opt submoves for the Lin–Kernighan TSP heuristic (2009, background): “For surveys of the problem and its applications, the reader is referred to the excellent volumes edited by Lawler et al. [24] and Gutin and Punnen [ 11 ].”