1
I Use This!
Inactive
Analyzed 1 day ago. based on code collected 1 day ago.

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.

Tags

algorithms c++ education gpl gplv3 graph learning math mathematics maths open_source qt qt4 qt5 testing university

Badges

In a Nutshell, TSP Solver and Generator...

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...

  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    check out hot projects on the Open Hub
  • ...
    65% of companies leverage OSS to speed application development in 2016
  • ...
    anyone with an Open Hub account can update a project's tags

Languages

C++
64%
C
18%
HTML
11%
3 Other
7%

30 Day Summary

Oct 26 2022 — Nov 25 2022

12 Month Summary

Nov 25 2021 — Nov 25 2022

Ratings

Be the first to rate this project
Click to add your rating
  
Review this Project!