Package: tspsg
Version: 0.1.4.170-beta2-0ubuntu12.04
Architecture: amd64
Maintainer: Oleksii Serdiuk <contacts@oleksii.name>
Installed-Size: 1423
Depends: libc6 (>= 2.14), 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-0ubuntu12.04_amd64.deb
Size: 940466
MD5sum: 947c7eee3a12e94306d0de7bba53a10f
SHA1: 19ba1849840bbb5a0a921e231ed5368171b7049d
SHA256: 756348a161d63fb54eb68e82ab1e238010f5e123677b74d60630a0323e690d3d
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-0ubuntu12.04
Architecture: i386
Maintainer: Oleksii Serdiuk <contacts@oleksii.name>
Installed-Size: 1411
Depends: libc6 (>= 2.1.3), 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-0ubuntu12.04_i386.deb
Size: 940914
MD5sum: b7b9cf0fdf739bea2ffef45c500ae879
SHA1: 136c77c1938f5afaf171660c64172b111fbf6fa4
SHA256: 12ce9cd41778d6fd1462484039aa522d57b839ee6837bfaa8573877d55ea5c37
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.