On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank

By Greg Wilson, G. Pawley. 2004

220 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

How researchers see this paper

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

In Artificial Intelligence

1. Quoc V. Le
2. Mohit Bansal
3. Mohammad Norouzi
4. Yoshua Bengio
5. Jianfeng Gao
6. Sergey Levine
7. Graham Neubig
8. Richard Socher

In Computer Networks and Communications

1. F. Favata
2. Mohammad Norouzi
3. Samy Bengio
4. R. Walker
5. Quoc V. Le
6. Irwan Bello

Citations in the corpus

• Neural Combinatorial Optimization with Reinforcement Learning (2016, methodology): “We employ the pointer network architecture, depicted in Figure 1, as our policy model to parameterizep(π | s).”
• A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem (1991, result): “Since publication, the Hopfield and Tank approach has been subjected to severe criticism, notably from Wilson and Pawley (1988) , who have failed to reproduce Hopfield's results and whose attempts to scale the algorithm to larger problem sets have met with only limited success.”