Changeset b424a7e320 in tspsg for README
- Timestamp:
- Aug 2, 2009, 9:47:45 PM (15 years ago)
- Branches:
- 0.1.3.145-beta1-symbian, 0.1.4.170-beta2-bb10, appveyor, imgbot, master, readme
- Children:
- 6b3d3c1bbb
- Parents:
- 9aa0e521ed
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
README
r9aa0e521ed rb424a7e320 5 5 $URL$ 6 6 7 This software is intended to generate and solve Travelling 8 Salesman Problem (TSP) tasks. It uses Branch and Bound method 9 for solving. An input is a number of cities and a matrix of 10 city-to-city travel prices. The matrix can be populated with 11 random values in a given range (useful for generating tasks). 12 The result is an optimal route, its price, step-by-step matrices 13 of solving and solving graph. The task can be saved in internal 14 binary format and opened later. The result can be printed without 15 the answer (only input matrix) or with it. 7 TSPSG is intended to generate and solve Travelling Salesman Problem 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. 10 The matrix can be populated with random values in a given range 11 (useful for generating tasks). The result is an optimal route, its 12 price, step-by-step matrices of solving and solving graph. The task 13 can be saved in internal binary format and opened later. The result 14 can be printed without the answer (only input matrix) or with it. 16 15 17 TSPSG may be useful for teachers to generate t asks for testsor18 just for regular users to solve TSPs. It is also may be used as an 19 example ofusing Branch and bound method to solve particular task.16 TSPSG may be useful for teachers to generate test tasks or just for 17 regular users to solve TSPs. Also, it may be used as an example of 18 using Branch and bound method to solve particular task. 20 19 21 20 TSPSG is free software: you can redistribute it and/or modify it
Note: See TracChangeset
for help on using the changeset viewer.