arXiv (All)
open access
COMPASS: Ordered Clustered Routing at 100K Scale
Large-scale routing often requires visiting clusters of nodes in a prescribed order, giving rise to the Ordered Clustered Traveling Salesman Problem (OCTSP). Optimizing each cluster independently seems natural, but misses non-local dependencies. We introduce the COMPASS algorithm for OCTSP, which co
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- COMPASS: Ordered Clustered Routing at 100K Scale#978451
- Throughput-Optimized Networks at Scale#1131552
- BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU#919339
- Integrating DBSCAN clustering and Dijkstra's algorithm for enhanced route planning: a case study of Oran, Algeria#191771
- Experimental multiple-path routing algorithm#220755
Record · ID 1034116
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive