The best route by the branch and bound [27]

Affiliates: 1,1 $how to earn
Pay with:
i agree with "Terms for Customers"
Sold: 2 last one 04.05.2015
Refunds: 0

Uploaded: 11.04.2009
Content: project_kommi_v2.1_11_04_09.rar 458,13 kB
Loyalty discount! If the total amount of your purchases from the seller NewSS more than:
50 $the discount is10%
15 $the discount is5%
5 $the discount is1%
If you want to know your discount rate, please provide your email:

Seller

NewSS information about the seller and his items
onlineAsk a question

Seller will give you a gift certificate in the amount of 14,5 RUB for a positive review of the product purchased..

Description

The best route by the branch and bound [27]

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


Additional information

The contents of the archive:

- Source code in the project delphi 7;

- Compiled executable (exe);

- Help system (HELP).

Feedback

0
No feedback yet.
Period
1 month 3 months 12 months
0 0 0
0 0 0
Seller will give you a gift certificate in the amount of 14,5 RUB for a positive review of the product purchased..
In order to counter copyright infringement and property rights, we ask you to immediately inform us at support@plati.market the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)