Published by
Published on
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.
License Free
File Size 17.68 MB
Version 0.1.4.170-beta2
Operating System Windows 2000 Windows 8 Windows 7 Windows Windows Server 2008 Windows 2003 Windows Vista Windows XP
Published by
Published on

ZDNET Latest Articles

Four must-have travel essentials

Four must-have travel essentials

It’s easy to think that all you need to carry with you these days is a smartphone and you’re ready for anything. But some extended periods away from my desk have discovered four things that are ‘must-haves’ for the traveller.

21 hours ago by in Hardware