Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets
We formalize the Steiner Traveling Salesman Problem (Steiner-TSP) on Graphs of Convex Sets (GCS), which seeks a minimum-cost closed trajectory through required convex sets while allowing optional transit vertices and revisits. To explore the resulting infinite solution space, we propose a unified branch-and-bound search over rooted walk prefixes. Additive lower-bound-graph costs bound committed prefixes, while a cut-separated connected-flow relaxation lower-bounds the residual cost of visiting every remaining target and returning to the root. Under a uniform positive-cost assumption, best-firs
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- LinkedLinked via arxiv author · 85%Jingtao Tang →
“Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets”
- LinkedLinked via arxiv author · 85%Yanzhang Ma →
“Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets”