![Gabriel Peyré on Twitter: "Oldies but goldies: J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, 1956. Computes the minimum spanning tree in n*log(n) operations. Gabriel Peyré on Twitter: "Oldies but goldies: J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, 1956. Computes the minimum spanning tree in n*log(n) operations.](https://pbs.twimg.com/media/Dr8eIOaUwAECERm.jpg:large)
Gabriel Peyré on Twitter: "Oldies but goldies: J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, 1956. Computes the minimum spanning tree in n*log(n) operations.
![optimization - Linear Programming Formulation of Traveling Salesman (TSP) in Wikipedia - Mathematics Stack Exchange optimization - Linear Programming Formulation of Traveling Salesman (TSP) in Wikipedia - Mathematics Stack Exchange](https://i.stack.imgur.com/lDMah.png)
optimization - Linear Programming Formulation of Traveling Salesman (TSP) in Wikipedia - Mathematics Stack Exchange
![Model and solution of the Traveling Salesman Problem with Python and Pyomo | by Claudemir Woche | Analytics Vidhya | Medium Model and solution of the Traveling Salesman Problem with Python and Pyomo | by Claudemir Woche | Analytics Vidhya | Medium](https://miro.medium.com/v2/resize:fit:445/1*71lAnN9K5Wh8d2XHiDgp8A.png)
Model and solution of the Traveling Salesman Problem with Python and Pyomo | by Claudemir Woche | Analytics Vidhya | Medium
![Traveling salesman problem - Cornell University Computational Optimization Open Textbook - Optimization Wiki Traveling salesman problem - Cornell University Computational Optimization Open Textbook - Optimization Wiki](https://optimization.cbe.cornell.edu/images/8/8b/NU_TSP.png)