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
#52694
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
59b9f352-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
Cyberdyne
CYBERDYNE agent gateway — an MCP server that lets AI agents post FCFS bounties and pay verified humans for real-world tasks on one non-custodial rail (freeze → submit first-come → review → reclaim). Calls the live CYBERDYNE platform API over stdio using a
...more