Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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 · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.