TSP Solver and Generator software generates and solves Travelling Salesman Problem (TSP) tasks using the Branch and Bound method. It is useful for generating test tasks for teachers or for solving TSPs for regular users.
TSPSG is a powerful software tool that will enable users to easily generate and solve Travelling Salesman Problem (TSP) tasks. Using the Branch and Bound method, TSPSG can solve complex TSP tasks with ease.
With TSPSG, you can input a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values within a given range, which is useful for generating tasks. Once complete, TSPSG will provide you with an optimal route, its price, step-by-step matrices of solving and a solving graph.
For your convenience, TSPSG allows you to save your task in an internal binary format that can be opened later. The software also has a variety of export options. You can choose to print your results or save them as PDF, HTML, or ODF.
Whether you're a teacher looking to generate test tasks, or a regular user looking to solve TSPs, TSPSG is the perfect tool for solving TSP tasks. With its ability to generate optimal routes and solve complex tasks, TSPSG is also an excellent example of using Branch and Bound method to solve a particular task.
With TSPSG, you can input a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values within a given range, which is useful for generating tasks. Once complete, TSPSG will provide you with an optimal route, its price, step-by-step matrices of solving and a solving graph.
For your convenience, TSPSG allows you to save your task in an internal binary format that can be opened later. The software also has a variety of export options. You can choose to print your results or save them as PDF, HTML, or ODF.
Whether you're a teacher looking to generate test tasks, or a regular user looking to solve TSPs, TSPSG is the perfect tool for solving TSP tasks. With its ability to generate optimal routes and solve complex tasks, TSPSG is also an excellent example of using Branch and Bound method to solve a particular task.
What's New
Version 0.1.4.170-beta2: N/A