arXiv cs.RO
Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets
볼록 집합 그래프 위의 슈타이너 외판원 문제를 위한 통합 분기한정 탐색
No write-up yet — this entry is still just the auto-fetched hook. Aaron's own summary (200–500 words) will replace this note once he's written it.