Fetching the paper…
Reading the bibliography…
This paper presents a framework to tackle combinatorial optimization problems using neural networks and reinforcement learning.
Solution of a large-scale traveling-salesman problem
George Dantzig, Ray Fulkerson, and Selmer Johnson · 1954
Earlier work this paper cites.
An effective heuristic algorithm for the traveling-salesman problem
S. Lin and B. W. Kernighan · 1973
Earlier work this paper cites.
Worst-case analysis of a new heuristic for the Travelling Salesman Problem
Nicos Christofides · 1976
Earlier work this paper cites.
The Euclidean Travelling Salesman Problem is NP-complete
Christos H. Papadimitriou · 1977
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi · 1983
Earlier work this paper cites.
”Neural” computation of decisions in optimization problems
John J. Hopfield and David W. Tank · 1985
Earlier work this paper cites.
An analogue approach to the Travelling Salesman
Richard Durbin · 1987
Earlier work this paper cites.
Self-organizing feature maps and the Travelling Salesman Problem
Bernard Angeniol, Gael De La Croix Vaubois, and Jean-Yves Le Texier · 1988
Earlier work this paper cites.
Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem
J. C. Fort · 1988
Earlier work this paper cites.
On the stability of the travelling salesman problem algorithm of hopfield and tank
G. V. Wilson and G. S. Pawley · 1988
Earlier work this paper cites.
A theoretical investigation into the performance of the Hopfield model
Sreeram V. B. Aiyer, Mahesan Niranjan, and Frank Fallside · 1990
Earlier work this paper cites.
Local search and the traveling salesman problem
DS Johnson · 1990
Earlier work this paper cites.
The self-organizing map
Teuvo Kohonen · 1990
Earlier work this paper cites.
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
Manfred Padberg and Giovanni Rinaldi · 1990
Earlier work this paper cites.
A study of the application of Kohonen-type neural networks to the travelling salesman problem
Favio Favata and Richard Walker · 1991
Earlier work this paper cites.
Simple statistical gradient following algorithms for connectionnist reinforcement learning
Ronald Williams · 1992
Cited alongside, same era.
Problem solving with optimization networks
Andrew Howard Gee · 1993
Cited alongside, same era.
Neural methods for the Traveling Salesman Problem: insights from operations research
Laura I. Burke · 1994
Cited alongside, same era.
A hierarchical strategy for solving traveling salesman problems using elastic nets
Andrew I. Vakhutinsky and Bruce L. Golden · 1995
Cited alongside, same era.
Long short-term memory
Sepp Hochreiter and Jurgen Schmidhuber · 1997
Cited alongside, same era.
No free lunch theorems for optimization
D. H. Wolpert and W. G. Macready · 1997
Cited alongside, same era.
LK-H, 2012
Keld Helsgaun · 2012
Later among the works it cites.
Comparison of neural networks for solving the Travelling Salesman Problem
Bert F. J. La Maire and Valeri M. Mladenov · 2012
Later among the works it cites.
Critical analysis of Hopfield’s neural network model for TSP and its comparison with heuristic algorithm for shortest path computation
Farah Sarwar and Abdul Aziz Bhatti · 2012
Later among the works it cites.
Hyper-heuristics: a survey of the state of the art
Edmund K. Burke, Michel Gendreau, Matthew R. Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and Rong Qu · 2013
Later among the works it cites.
Tabu Search∗
Fred Glover and Manuel Laguna · 2013
Later among the works it cites.
Adam: A method for stochastic optimization
Diederik Kingma and Jimmy Ba · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Neural networks for combinatorial optimization: a review of more than a decade of research
Kate A. Smith · 1999
Cited alongside, same era.
Guided local search and its application to the traveling salesman problem
Christos Voudouris and Edward Tsang · 1999
Cited alongside, same era.
An effective implementation of the Lin-Kernighan traveling salesman
Keld Helsgaun · 2000
Cited alongside, same era.
Implementing the dantzig-fulkerson-johnson algorithm for large traveling salesman problems
David Applegate, Robert Bixby, Vašek Chvátal, and William Cook · 2003
Cited alongside, same era.
Hyperheuristics: An emerging direction in modern search technology
Edmund Burke, Graham Kendall, Jim Newall, Emma Hart, Peter Ross, and Sonia Schulenburg · 2003
Cited alongside, same era.
Knapsack Problems
Hans Kellerer, Ulrich Pferschy, and David Pisinger · 2004
Cited alongside, same era.
Sequence to sequence learning with neural networks
Ilya Sutskever, Oriol Vinyals, and Quoc V. Le · 2014
Later among the works it cites.
Neural machine translation by jointly learning to align and translate
Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio · 2015
Later among the works it cites.
Tensorflow: A system for large-scale machine learning
Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al · 2016
Closest in time.
Noisy parallel approximate decoding for conditional recurrent language model
Kyunghyun Cho · 2016
Closest in time.
Or-tools, google optimization tools, 2016
Google · 2016
Closest in time.
Asynchronous methods for deep reinforcement learning
Volodymyr Mnih, Adrià Puigdomènech Badia, Mehdi Mirza, Alex Graves, Timothy P. Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu · 2016
Closest in time.
Learning to learn for global optimization of black box functions
Chen Yutian, Hoffman Matthew W., Colmenarejo Sergio Gomez, Denil Misha, Lillicrap Timothy P., and de Freitas Nando · 2016
Closest in time.
Neural architecture search with reinforcement learning
Barret Zoph and Quoc Le · 2016
Closest in time.