Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem

By Jean-Claude Fort. 1988

How researchers see this paper

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

1. Yoshua Bengio
2. Quoc V. Le
3. Hieu Pham
4. Irwan Bello
5. Mohammad Norouzi
6. Mohit Bansal
7. Sergey Levine
8. Ruslan Salakhutdinov

Citations in the corpus

• Neural Combinatorial Optimization with Reinforcement Learning (2016, methodology): “Perhaps most pr minent is the invention of Elastic Nets as a means to solve TSP (Durbin, 1987), and the applic tion of Self Organizing Map to TSP (Fort, 1988; Angeniol et al., 1988; Kohonen, 1990).”
• An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem (2019, methodology): “Historical work has focused on learning-based approaches for TSP using Hopfield networks [Hopfield and Tank, 1985] and deformable template models [Fort, 1988, Angeniol et al., 1988].”