Aug 2026
Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets
The Steiner Traveling Salesman Problem is formalized on Graphs of Convex Sets (GCS), which seeks a minimum-cost closed trajectory through required convex sets while allowing optional transit vertices and revisits, and a unified branch-and-bound search over rooted walk prefixes is proposed.
J. Tang, Hang Ma
· arXiv.org · 1 citation