source: tspsg/README @ b968056ce3

TSPSG - TSP Solver and Generator
Copyright (C) 2007-2009 Lёppa <contacts[at]oleksii[dot]name>

$Id$
$URL$

This software is intended to generate and solve Travelling
Salesman Problem (TSP) tasks. It uses Branch and Bound method
for solving. An input is a number of cities and a matrix of
city-to-city travel prices. The matrix can be populated with
random values in a given range (useful for generating tasks).
The result is an optimal route, its price, step-by-step matrices
of solving and solving graph. The task can be saved in internal
binary format and opened later. The result can be printed without
the answer (only input matrix) or with it.

TSPSG may be useful for teachers to generate tasks for tests or
just for regular users to solve TSPs. It is also may be used as an
example of using Branch and bound method to solve particular task.

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

TSPSG 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 TSPSG.  If not, see <http://www.gnu.org/licenses/>.

Third parties:
* This software is created using opensource version of Qt toolkit,
  see http://www.qtsoftware.com/
* The icons used in this software are part of Oxygen Icons project
  licensed according to the GNU Lesser General Public License,
  see http://www.oxygen-icons.org/