Traveling Salesman Problem
Traveling Salesman Problem
Publisher: IN-TECH | ISBN: 9537619107 | edition 2008 | PDF | 212 pages | 11,3 mb
Publisher: IN-TECH | ISBN: 9537619107 | edition 2008 | PDF | 212 pages | 11,3 mb
The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assigned to the edges of a finite complete graph, and the objective is to find a Hamiltonian cycle, a cycle passing through all the vertices, of the graph while having the minimum total weight. In the TSP context, Hamiltonian cycles are commonly called tours.
Traveling Salesman Problem
>>:: NO PASSWORD ::<<
Uploading
Qube
Megaupload
>>::..::!!!NO MIRRORS, READ THE RULES!!!::..::<<
Not all books on AvaxHome appear on the homepage. In order not to miss many of them follow
ebooks section (see top of each page on AH)
and visit -<My Blog>- too :-)
WARNING!!! IN COMMENTS ANY RAPIDSHARE*******.TK SITE WILL STEAL YOUR PASSWORD AND ACCOUNT DO NOT CLICK!!!