Fetching the paper…
Reading the bibliography…
The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial problem, starting with von Neumann in 1951.
Solution of a large-scale traveling-salesman problem
George Dantzig, Ray Fulkerson, and Selmer Johnson. 1954 · 1954
Earlier work this paper cites.
A method for solving traveling-salesman problems
Georges A Croes. 1958 · 1958
Earlier work this paper cites.
Dynamic programming treatment of the travelling salesman problem
Richard Bellman. 1962 · 1962
Earlier work this paper cites.
A dynamic programming approach to sequencing problems
Michael Held and Richard M Karp. 1962 · 1962
Earlier work this paper cites.
Computer solutions of the traveling salesman problem
Shen Lin. 1965 · 1965
Earlier work this paper cites.
An effective heuristic algorithm for the traveling-salesman problem
Shen Lin and Brian W Kernighan. 1973 · 1973
Earlier work this paper cites.
Worst-case analysis of a new heuristic for the travelling salesman problem
Nicos Christofides. 1976 · 1976
Earlier work this paper cites.
The HARPY speech recognition system
Bruce T Lowerre. 1976 · 1976
Earlier work this paper cites.
The Lagrangian relaxation method for solving integer programming problems
Marshall L Fisher. 1981 · 1981
Earlier work this paper cites.
Optimization by simulated annealing
Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983 · 1983
Earlier work this paper cites.
“Neural” computation of decisions in optimization problems
John J Hopfield and David W Tank. 1985 · 1985
Earlier work this paper cites.
Local optimization and the traveling salesman problem. In International colloquium on automata, languages, and programming . Springer, 446–461
David S Johnson. 1990 · 1990
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Ronald J Williams. 1992 · 1992
Earlier work this paper cites.
The Travelling Saleman Problem: A case study in Local Optimization
S Johnson David and A McGeoch Lyle. 1995 · 1995
Earlier work this paper cites.
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Keld Helsgaun. 2000 · 2000
Cited alongside, same era.
Word reordering and a dynamic programming beam search algorithm for statistical machine translation
Christoph Tillmann and Hermann Ney. 2003 · 2003
Cited alongside, same era.
Branching rules revisited
Tobias Achterberg, Thorsten Koch, and Alexander Martin. 2005 · 2005
Cited alongside, same era.
The traveling salesman problem: a computational study
David L Applegate, Robert E Bixby, Vasek Chvatal, and William J Cook. 2006 · 2006
Cited alongside, same era.
combining 2-opt, 3-opt and 4-opt with k-swap-kick perturbations for the traveling salesman problem
Andrius Blazinskas and Alfonsas Misevicius. 2011 · 2011
Cited alongside, same era.
An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems
Keld Helsgaun. 2017 · 2017
Later among the works it cites.
A note on learning algorithms for quadratic assignment with graph neural networks
Alex Nowak, Soledad Villar, Afonso S Bandeira, and Joan Bruna. 2017 · 2017
Later among the works it cites.
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017 · 2017
Later among the works it cites.
Learning heuristics for the tsp by policy gradient. In International conference on the integration of constraint programming, artificial intelligence, and operations research . Springer, 170–181
Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, and Louis-Martin Rousseau. 2018 · 2018
Later among the works it cites.
Learning the multiple traveling salesmen problem with permutation invariant pooling networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Alex Graves, Ioannis Antonoglou, Daan Wierstra, and Martin Riedmiller. 2013 · 2013
Cited alongside, same era.
Neural machine translation by jointly learning to align and translate
Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014 · 2014
Cited alongside, same era.
OR-tools: Google’s Operations Research tools
Google. 2015 · 2015
Cited alongside, same era.
Deep learning
Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015 · 2015
Cited alongside, same era.
Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015 · 2015
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. 2016 · 2016
Cited alongside, same era.
Mastering the game of Go with deep neural networks and tree search
David Silver, Aja Huang, Chris J Maddison, Arthur Guez, Laurent Sifre, George Van Den Driessche, Julian Schrittwieser, Ioannis Antonoglou, Veda Panneershelvam, Marc Lanctot, et al · 2016
Cited alongside, same era.
Yoav Kaempfer and Lior Wolf. 2018 · 2018
Later among the works it cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke Van Hoof, and Max Welling. 2018 · 2018
Later among the works it cites.
Reinforcement learning for solving the vehicle routing problem
Mohammadreza Nazari, Afshin Oroojlooy, Lawrence V Snyder, and Martin Takáč. 2018 · 2018
Later among the works it cites.
Exact Combinatorial Optimization with Graph Convolutional Neural Networks. In Advances in Neural Information Processing Systems , Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d’Alché-Buc, Emily B. Fox, and Roman Garnett (Eds.). 15554–15566
Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. 2019 · 2019
Later among the works it cites.
An efficient graph convolutional network technique for the travelling salesman problem
Chaitanya K Joshi, Thomas Laurent, and Xavier Bresson. 2019 · 2019
Later among the works it cites.
Learning improvement heuristics for solving routing problems
Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, and Andrew Lim. 2019 · 2019
Later among the works it cites.
Best-first beam search
Clara Meister, Tim Vieira, and Ryan Cotterell. 2020 · 2020
Later among the works it cites.
Solving Mixed Integer Programs Using Neural Networks
Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O’Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, and Yori Zwols. 2020 · 2020
Later among the works it cites.
A graph neural network assisted Monte Carlo tree search approach to traveling salesman problem
Zhihao Xing and Shikui Tu. 2020 · 2020
Later among the works it cites.