TSPSG is a tool for generating and solving Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method to find the optimal route, and can generate tasks with random values within a given range. The results can be saved in an internal binary format, and can be printed or exported as PDF, HTML, or ODF. TSPSG is useful for teachers to generate test tasks, as well as for anyone who needs to solve TSP tasks.
Comments