**TSPSG: TSP Solver and Generator**

**Author:**- Copyright © 2007-2010 Lёppa <contacts[at]oleksii[dot]name>

**Homepage:** tspsg.info

##
ABOUT TSPSG

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

##
DOCUMENTATION PAGES

TSPSG ChangeLog

- TSPSG v0.1.3 beta 1 (build 145)
- TSPSG v0.1.2 alpha 2 (build 100)
- TSPSG v0.1.1 alpha 1 (build 42)

TSPSG Installation Guide

- REQUIREMENTS
- ASSUMPTIONS
- SUPPORTED PLATFORMS
- BUILDING AND INSTALLATION
- UNINSTALLATION
- TROUBLESHOOTING
- NOTES
- REFERNECES

##
LICENSE

This program is free software: you can redistribute it and/or modify

it under the terms of the GNU General Public License as published by

the Free Software Foundation, either version 3 of the License, or

(at your option) any later version.

This program is distributed in the hope that it will be useful,

but WITHOUT ANY WARRANTY; without even the implied warranty of

MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

GNU General Public License for more details.

You should have received a copy of the GNU General Public License

along with this program. If not, see <http://www.gnu.org/licenses/>.