Project Summary
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses the 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.
Badges
In a Nutshell, TSP Solver and Generator...
- ...
- ...
- ...
-
...
took an estimated 2 years of effort (COCOMO model)
starting with its first commit in October, 2007
ending with its most recent commit about 8 years ago
Quick Reference
GNU General Public License v2.0 or later
Permitted
Commercial Use
Modify
Distribute
Place Warranty
Forbidden
Sub-License
Hold Liable
Required
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
use of OSS increased in 65% of companies in 2016
-
...
anyone with an Open Hub account can update a project's tags
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
30 Day SummaryMar 28 2024 — Apr 27 2024
|
12 Month SummaryApr 27 2023 — Apr 27 2024
|
