Changeset 110 in tspsg-svn for trunk/README.txt
- Timestamp:
- Apr 28, 2010, 1:38:10 AM (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/README.txt
r104 r110 6 6 7 7 TSPSG is intended to generate and solve Travelling Salesman Problem 8 (TSP) tasks. It uses Branch and Bound method for solving. An input9 is number of cities and matrix of city-to-city travel costs. 10 The matrix can be populated with random values in a given range 11 (useful for generating tasks). The result is an optimal route, its12 price, step-by-step matrices of solving and solving graph. The task13 can be saved in internal binary format and opened later. The result14 can be printed without the answer (only input matrix) or with it.8 (TSP) tasks. It uses Branch and Bound method for solving. Its input is 9 a number of cities and a matrix of city-to-city travel costs. The 10 matrix can be populated with random values in a given range (which is 11 useful for generating tasks). The result is an optimal route, its 12 price, step-by-step matrices of solving and a solving graph. The task 13 can be saved in an internal binary format and opened later. The result 14 can be printed or saved as PDF, HTML, or ODF. 15 15 16 16 TSPSG may be useful for teachers to generate test tasks or just for 17 17 regular users to solve TSPs. Also, it may be used as an example of 18 using Branch and bound method to solveparticular task.18 using Branch and Bound method to solve a particular task. 19 19 20 20 TSPSG is free software: you can redistribute it and/or modify it
Note: See TracChangeset
for help on using the changeset viewer.