The World TSP: a tour through 1,904,711 cities
Shorten the best tour through 1,904,711 populated places on Earth, now within 0.0471% of optimal, or raise the lower bound set in 2007.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
符合的问题
The 30 unsolved VLSI traveling salesman instances
Find shorter tours or first lower bounds for the 30 VLSI traveling salesman instances, 14,233 to 744,710 cities, that remain unsolved.
Burma and China: the two unsolved National TSP instances
Find shorter tours or matching lower bounds for the Burma (33,708 cities) and China (71,009 cities) instances, the last open National TSPs.
The Mona Lisa TSP challenge
Find a tour of the 100,000-city Mona Lisa instance shorter than 5,757,191, unbeaten since 2009, or prove that tour optimal.
Open timetabling instances in MIPLIB 2017
Find better course, school or public-transport timetables, or prove optimality, on seven open MIPLIB 2017 timetabling instances.
Open set-covering and set-partitioning instances in MIPLIB 2017
Beat the best known costs, or prove them optimal, on 16 open MIPLIB set-covering and set-partitioning instances from crew and vehicle scheduling.
Estimating metric TSP cost below factor 2 with sublinear queries
Estimate the shortest tour of an n-point metric within a factor below 2 from o(n²) distance queries, or show it cannot be done.
The XL set: vehicle routing with 1,000 to 10,000 customers
Beat the best-known routes on 100 capacitated vehicle routing instances with 1,000 to 10,000 customers, released for the 2026 BKS Challenge.
The 39 open instances of the CVRPLIB X set
Find cheaper routes, or prove optimality, for the 39 X instances of the capacitated vehicle routing problem that are still unsolved.