We don't have a complete solution to the traveling salesman problem for very large numbers of locations.
open
Global / Unspecified, Global
Finding the shortest possible route visiting a long list of locations becomes exponentially harder as the list grows, and no fully efficient general solution exists. Logistics, chip design, and delivery networks all run into this limit.
Citation ID: WS00292
Title: We don't have a complete solution to the traveling salesman problem for very large numbers of locations.
URL: https://worldsolve.org/index.php?api=problem&id=292