Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem

High-performance TSP solvers such as Lin-Kernighan-Helsgaun (LKH) search within a candidate graph -- a small subset of edges pre-selected for the solver -- rather than over the complete graph. The two leading sparsification heuristics, α-Nearest and POPMUSIC, each fall short of the density-coverage balance: α-Nearest is dense with stable recall, while POPMUSIC is sparser but its recall degrades with scale. Their union closes the recall gap while remaining far below the complete graph in density, leaving room for further reduction. Existing learning-based sparsifiers score edges on the complete graph, an approach that is expensive and largely limited to Euclidean instances. We propose a two-stage method that inverts this logic. Stage~1 takes the union of α-Nearest and POPMUSIC, achieving near-perfect recall at ~6N edges. Crucially, the union annotates each edge with its source provenance -- whether it was endorsed by α-Nearest, POPMUSIC, or both. Stage~2 trains a lightweight classifier on these annotated edges and prunes the lowest-scoring ones. Because dual-source edges are almost always optimal, the learning problem reduces to filtering the single-source subset -- a substantially easier task than classifying all O(N2) edges from scratch. Across four distance types, five spatial distributions, and problem sizes from 50 to 500, the pipeline reduces candidate-graph density by 37-47% while retaining ≥99.69% of optimal-tour edges, and matches or exceeds the coverage of recent Euclidean-only neural sparsifiers at lower density at TSP500.