The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.
Cross-referenced across 55 tracked directories
#52709
Popularity Rank
1 / 55
Listed In
Emerging
Adoption Stage
10/10/2025
First Seen
Recently added to the ecosystem
Score: 100/100
0 dependency vulnerabilities found
b959a1af-c170-4c4c-ad27-457ed2959de8
Search a vast catalog of books on Anna's Archive. Discover editions, formats, and metadata to quickly pinpoint the right copy. Download selected titles for fast, offline access.
...more59b9f352-8cdc-44d3-9dd9-db3bfa521880
No description available
planetabhi
A comprehensive local MCP server for Figma. Connect Figma with the Gemini CLI, Cursor, and Claude Desktop.
azmartone67
** Data center intelligence platform with 15 MCP tools. Search