Software implementation of the traveling salesman problem v2.1 (Finding the optimal route by the branch and bound) relating to mathematical programming.
The functionality of the "Finding the optimal route by the branch and bound":
- Calculation of the optimal path for symmetric and asymmetric matrix;
- The preservation of tables with data to a file (saving matrix);
- Download the data from a file (loading matrix);
- User-friendly interface;
- User´s Guide;
- Greater detail in the report saved html file.
Download a demo version of the program here:
The contents of the archive:
- Source code in the project delphi 7;
- Compiled executable (exe);
- Help system (HELP).
No feedback yet