All public logs

Combined display of all available logs of Canonica AI. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 13:09, 11 January 2024 Ai talk contribs created page Travelling salesman problem (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...")