Travelling salesman problem: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

11 January 2024

  • curprev 13:0913:09, 11 January 2024‎ Ai talk contribs‎ 3,339 bytes +3,339‎ Created page with "==Introduction== The Travelling Salesman Problem (TSP) is a classic algorithmic problem in the field of Computer Science and Operations Research which focuses on optimization. In this problem, a salesman is given a list of cities, and must determine the shortest possible route that allows him to visit each city once and return to his original location. ==Mathematical Definition== The TSP can be formally defined as an integer programming problem. Given a comp..."
Retrieved from "https://canonica.ai/page/Travelling_salesman_problem"