0.1.4.170-beta2-bb10appveyorimgbotreadme
|
Last change
on this file since 144fbe6b96 was
8dcf4701e6,
checked in by Oleksii Serdiuk, 14 years ago
|
|
Added deployment rules for Maemo 5 target. Untested.
|
-
Property mode set to
100644
|
|
File size:
855 bytes
|
| Line | |
|---|
| 1 | The Debian Package tspsg |
|---|
| 2 | ---------------------------- |
|---|
| 3 | |
|---|
| 4 | TSPSG is intended to generate and solve Travelling Salesman Problem |
|---|
| 5 | (TSP) tasks. It uses Branch and Bound method for solving. Its input is |
|---|
| 6 | a number of cities and a matrix of city-to-city travel costs. The |
|---|
| 7 | matrix can be populated with random values in a given range (which is |
|---|
| 8 | useful for generating tasks). The result is an optimal route, its |
|---|
| 9 | price, step-by-step matrices of solving and a solving graph. The task |
|---|
| 10 | can be saved in an internal binary format and opened later. The result |
|---|
| 11 | can be printed or saved as PDF, HTML, or ODF. |
|---|
| 12 | |
|---|
| 13 | TSPSG may be useful for teachers to generate test tasks or just for |
|---|
| 14 | regular users to solve TSPs. Also, it may be used as an example of |
|---|
| 15 | using 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.
