NCBI PubMed Central
open access
Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks.
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
- A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem#1014130
- Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets#480082
- Solutions to the symmetric traveling salesman problem for 1354 locations in the Kyiv region: Concorde solver#387315
- Combinatorial optimization and reasoning with graph neural networks#19719
- A branch-cut-and-price algorithm for the park-and-loop routing problem#433298
Record · ID 214202
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