Back to feed
AR
arXiv CS.AI
7/14/2026
GES-TSP: Graph Edge Sparsification for TSP

GES-TSP: Graph Edge Sparsification for TSP

Short summary

GES is a learning-based graph sparsification method for Euclidean TSP that adaptively prunes edges using geometric and combinatorial structure. It removes up to 95% of edges on MATILDA while keeping the optimality gap under 1%, and generalizes to TSPLIB with pruning rates exceeding 99% on some large instances. The approach significantly accelerates exact TSP solving without sacrificing solution quality.

  • •GES uses learned sparsification to prune up to 95% of edges while keeping optimality gap under 1%
  • •Generalizes to TSPLIB with >99% pruning on some large instances
  • •Combines geometric structure with combinatorial optimization for instance-adaptive graph reduction

Generated with AI, which can make mistakes.

#research-breakthrough
Read full article at arXiv CS.AI

Is this a good recommendation for you?

Comments

Failed to load comments. Please try again.

Explore more

The original title is about LP Mining with LP2Graph for railway rescheduling. Let me rewrite this as a punchy headline.
arXiv CS.AI
Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths
arXiv cs.LG
Low-Latency Relay Selection in NR-V2X Vehicular Communications via Graph Isomorphism Networks with Edge Features
arXiv cs.LG
GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning
arXiv CS.AI