TSP at Waterloo company blog

Shortest-possible walking tour to 81,998 bars in South Korea

math.uwaterloo.ca 5 min read

We have solved a traveling salesman problem (TSP) to walk to 81,998 bars in South Korea. The problem was created using the Open Source Routing Machine (OSRM) to build a table of the 3,361,795,003 point-to-point travel times, one for each pair of bar locations. Our computation produced a tour together with a proof that…

Points

435

HN comments

139

Submissions

1

Cited by

0 commenters

Math & AlgorithmsScience & Space2025

Related posts from the same era

Airfoil

Bartosz Ciechanowski20242,544 points356 commentscited by 8 details

Learning to Reason with LLMs

OpenAI Blog20241,654 points1,261 commentscited by 18 details

An OpenAI model has disproved a central conjecture in discrete geometry

OpenAI Blog20261,429 points1,055 commentscited by 13 details

AI solves International Math Olympiad problems at silver medal level

Google DeepMind20241,370 points525 commentscited by 16 details

Sharing AI progress in mathematics

OpenAI Blog20261,363 points1,539 comments details

On the Navier–Stokes Millennium Prize Problem

OpenAI Blog20261,346 points1,137 commentscited by 21 details