https://pypi.org/project/iflow-mcp-travelling-salesman-problem-be/ Recent updates to the Python Package Index for iflow-mcp-travelling_salesman_problem_be en https://pypi.org/project/iflow-mcp-travelling-salesman-problem-be/0.2.0/ 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. Fri, 10 Oct 2025 02:45:10 GMT