Changeset 65 in tspsg-svn for trunk/README
- Timestamp:
- Oct 20, 2009, 9:38:01 PM (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/README
r47 r65 7 7 TSPSG is intended to generate and solve Travelling Salesman Problem 8 8 (TSP) tasks. It uses Branch and Bound method for solving. An input 9 is number of cities and matrix of city-to-city travel prices.9 is number of cities and matrix of city-to-city travel costs. 10 10 The matrix can be populated with random values in a given range 11 11 (useful for generating tasks). The result is an optimal route, its
Note: See TracChangeset
for help on using the changeset viewer.