Solution of a Large-Scale Traveling-Salesman Problem

By V. Chvátal, W. Cook, G. Dantzig, D. R. Fulkerson, Selmer M. Johnson. 1954

How researchers see this paper

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

Citations in the corpus

Neural Combinatorial Optimization with Reinforcement Learning (2016, background): “(2) one needs to have access to groundtruth output permutations to optimize the parameters with conditional log-likelihood.”
Shortest‐path network interdiction (2002, methodology): “We can therefore lift II-SVI 1 because interdiction of arc 1 alone cannot raise the ceiling on z over the lower bound z (cid:1) 16.”
Network optimization : continuous and discrete models (1998, methodology): “The surveys by Patricksson [1991], and by Florian and Hearn [1995] focus primarily on transportation problems, and give a large number of references.”
Optimization for machine learning (2010, unknown): “The details can be found in (Bubeck et al., 2010).”
Solving Connected Subgraph Problems in Wildlife Conservation (2010, methodology): “[4] suggest using the directed Dantzig-Fulkerson-Johnson formulation [5] with subtour elimination constraints enforcing the tree structure of the selected subgraph.”
Rich vehicle routing problems: From a taxonomy to a definition (2015, background): “Going back to the paper by Dantzig, Fulkerson, and Johnson (1954), each customer has to be served once and only once.”
An effective implementation of the Lin-Kernighan traveling salesman heuristic (2000, methodology): “The now well-known computing method, branch and bound, was first used in the context of TSP [ 3 , 4]. It is also worth mentioning that research on TSP was an important driving force in the development of the computational complexity theory in the beginning of the 1970s [5].”
On the History of Combinatorial Optimization (Till 1960) (2005, background): “Dantzig, Fulkerson, and Johnson [32] say: It appears to have been discussed informally among mathematicians at mathematics meetings for many years.”
Combinatorial optimization and reasoning with graph neural networks (2021, methodology): “An optimal solution to this problem instance (left) was found by Dantzig, Fulkerson and Johnson [24] in the 1950s.”