Augmented graphs of convex sets encode the TSP specification to solve it exactly as a shortest path problem, with a precise link to the Bellman-Held-Karp algorithm and a scalable branch-and-bound heuristic using minimum 1-trees.
A unified and scalable method for optimizat ion over graphs of convex sets,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Augmented Graphs of Convex Sets and the Traveling Salesman Problem
Augmented graphs of convex sets encode the TSP specification to solve it exactly as a shortest path problem, with a precise link to the Bellman-Held-Karp algorithm and a scalable branch-and-bound heuristic using minimum 1-trees.