Content: project_kommi_v2.1_11_04_09.rar (458.13 KB)
Uploaded: 11.04.2009

Positive responses: 0
Negative responses: 0

Sold: 2
Refunds: 0

Seller: NewSS
information about the seller and its items

Ask a question

Loyalty discount! If the total amount of your purchases from the seller more than:

$5 the discount is 1%
$15 the discount is 5%
$50 the discount is 10%
$4.77
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);


In addition:

- User-friendly interface;

- User´s Guide;

- Greater detail in the report saved html file.


Download a demo version of the program here:

http://ns2d.ru/soft/matematika/nakhozhdenie-optimalnogo-marshruta-metodom-vetvei-i-granits-v21


The contents of the archive:

- Source code in the project delphi 7;

- Compiled executable (exe);

- Help system (HELP).

No feedback yet
You are at the demonstration site for digital goods GDS.Digital. These online prices - reference information and do not constitute a public offer. Final price of the goods and the purchase price stated in the invoice issued to the buyer for payment. Carefully read the product description and rating of the seller before buying.