arXiv CSopen access
Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets
artificial intelligence, reasoning, knowledge representation
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 480082
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.