Travelling salesman problem. Best route finder
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. Example body params: […
68 subscribers
1 endpoints
The in-depth APIMemo review for this API hasn't been published yet —
the data below comes straight from the public marketplace listing.
Travelling salesman problem. Best route finder endpoints
| Method | Endpoint | Description |
|---|---|---|
| POST |
go / |
Find the best (shortest) route |
Travelling salesman problem. Best route finder pricing
| Plan | Price | Rate limit | Quotas |
|---|---|---|---|
| BASIC | Free | 5 / second |
|
| PRO | $24.99 / month | 5 / second |
|
| ULTRA Recommended | $49.99 / month | 5 / second |
|
| MEGA | $99.99 / month | 5 / second |
|
