source: tspsg-svn/trunk/qtc_packaging/debian_fremantle/README @ 160

Last change on this file since 160 was 153, checked in by laleppa, 14 years ago

Added deployment rules for Maemo 5 target. Untested.

File size: 855 bytes
Line 
1The Debian Package tspsg
2----------------------------
3
4TSPSG is intended to generate and solve Travelling Salesman Problem
5(TSP) tasks. It uses Branch and Bound method for solving. Its input is
6a number of cities and a matrix of city-to-city travel costs. The
7matrix can be populated with random values in a given range (which is
8useful for generating tasks). The result is an optimal route, its
9price, step-by-step matrices of solving and a solving graph. The task
10can be saved in an internal binary format and opened later. The result
11can be printed or saved as PDF, HTML, or ODF.
12
13TSPSG may be useful for teachers to generate test tasks or just for
14regular users to solve TSPs. Also, it may be used as an example of
15using Branch and Bound method to solve a particular task.
16
17 -- Oleksii Serdiuk <[email protected]>  Fri, 18 Feb 2011 21:18:50 +0200
Note: See TracBrowser for help on using the repository browser.