Traveling salesman problem

Last updated Jun 24, 2022

• Type atom
• Status needs revision

Find the shortest possible tour that visits a list of cities exactly once and returns to its starting point. This is an NP-Complete problem.