Graduation branch and bound method for the problem of a Salesman

Affiliates: 0,6 $how to earn
Pay with:
i agree with "Terms for Customers"
Sold: 0 Uploaded: 10.08.2009
Content: 90810144512797.rar 826,23 kB
Loyalty discount! If the total amount of your purchases from the seller bsnbot more than:
5 $the discount is20%
If you want to know your discount rate, please provide your email:

Product description

Full title:
ANALYSIS METHODS graph theory solve the problem of the traveling salesman in the program "Roads Krasnoyarsk"

In addition to the text of research paper (59 pp.) Contains files with algorithms and posters (for presentations), as the source files of the program "Roads of Krasnoyarsk" to exe-file for Borland Delphi.

Additional information

Contents.

INTRODUCTION. 3
Graph theory 5
Preliminary information. 5
Dijkstra's algorithm. 6
Branch and bound method. 10
PROGRAM DESCRIPTION. 25
RESOLUTION traveling salesman problem VARIOUS METHODS 26
CREATION OF DATABASES AND route on the map. 29
Determining the optimal route on a road map, Krasnoyarsk 32
SOFTWARE IMPLEMENTATION. 33
CONCLUSION. 34
REFERENCES 35
APPENDIX A. APPEARANCE. 36
Appendix B of the program text. 38

Feedback

0
No feedback yet.
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.)