GalaxyTSP: A New Billion-Node Benchmark for TSP

no code implementations • NeurIPS Workshop LMCA 2020 • Iddo Drori, Brandon J Kates, William R. Sickinger, Anant Girish Kharkar, Brenda Dietrich, Avi Shporer, Madeleine Udell

We approximate a Traveling Salesman Problem (TSP) three orders of magnitude larger than the largest known benchmark, increasing the number of nodes from millions to billions.

Scheduling Traveling Salesman Problem

Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time

no code implementations • 6 Jun 2020 • Iddo Drori, Anant Kharkar, William R. Sickinger, Brandon Kates, Qiang Ma, Suwen Ge, Eden Dolev, Brenda Dietrich, David P. Williamson, Madeleine Udell

Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure.

Combinatorial Optimization Traveling Salesman Problem