The traveling salesman problem on a graph and some related integer polyhedra

How researchers see this paper

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

Learning Combinatorial Optimization Algorithms over Graphs (2017, background): “– Graph Traveling Salesman Problem (GTSP) (Cornuéjols et al., 1985): Given a graph G, find a cycle of minimum total weight that visits each node of the graph G at least once.”
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (2003, methodology): “We compare four di erent representations: (1) each cut in the form given in (20) (the \outside" form), (2) each cut in the form given in (21) (the \inside" form), (3) each cut in the inside form with individual sets S complemented if it decreases the number of nonzero coeÆcients among the columns in”
The Design of Approximation Algorithms (2011, methodology): “traveling salesman problem was introduced by Cornuéjols, Fonlupt, and Naddef [84], and the dynamic programming algorithm of Exercise 10.”
Design and control of warehouse order picking: A literature review (2006, methodology): “In Cornuéjols et al. (1985) it is shown that the algorithm of Ratliff and Rosenthal (1983) can be extended to solve the Steiner Traveling Salesman Problem in all, so-called, series–parallel graphs. In De Koster and Van der Poort (1998) and Roodbergen and De Koster (2001a,b) the algorithm by Ratliff ”