Package: tspsg
Version: 0.1.4.170-beta2-1debian7.0
Architecture: amd64
Maintainer: Oleksii Serdiuk <contacts@oleksii.name>
Installed-Size: 1423
Depends: libc6 (>= 2.2.5), libgcc1 (>= 1:4.1.1), libqt4-svg (>= 4:4.5.3), libqtcore4 (>= 4:4.8.0), libqtgui4 (>= 4:4.6.1), libstdc++6 (>= 4.1.1)
Filename: ./amd64/tspsg_0.1.4.170-beta2-1debian7.0_amd64.deb
Size: 936174
MD5sum: 77bd0baa31816a75f1d37a7876eda8d7
SHA1: 3e0aeda2dea28e4fd005f5bf733093a2dbb874f5
SHA256: a97de1564aae391fce1574781b4b4cbb047ed368022076b4d7a31e64d2a46137
Section: math
Priority: optional
Homepage: http://tspsg.info/
Description: TSP Solver and Generator
 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.

Package: tspsg
Version: 0.1.4.170-beta2-1debian7.0
Architecture: i386
Maintainer: Oleksii Serdiuk <contacts@oleksii.name>
Installed-Size: 1426
Depends: libc6 (>= 2.3.6-6~), libgcc1 (>= 1:4.1.1), libqt4-svg (>= 4:4.5.3), libqtcore4 (>= 4:4.8.0), libqtgui4 (>= 4:4.6.1), libstdc++6 (>= 4.1.1)
Filename: ./i386/tspsg_0.1.4.170-beta2-1debian7.0_i386.deb
Size: 940988
MD5sum: 7b14ab5f4c65f3bda022275cdad92a38
SHA1: 8e6d6192cb25b9b187f8aa20d7f1e72a6cb331fb
SHA256: 84daa1445bd226d1f1d4caee9c9c2245c452ac66ce9fbd9dd888e3791aeb5144
Section: math
Priority: optional
Homepage: http://tspsg.info/
Description: TSP Solver and Generator
 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.