Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
9Activity
0 of .
Results for:
No results containing your search query
P. 1
Algorithm A Traveling Salesman Problem

Algorithm A Traveling Salesman Problem

Ratings: (0)|Views: 238 |Likes:
Published by Iwan

More info:

Categories:Types, School Work
Published by: Iwan on Dec 30, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

07/30/2011

pdf

text

original

 
 
An Algorithm for theTraveling SalesmanProblem
 John D. C. Little, Katta G. Murty,Dura W. Sweeney, and CarolineKarel1963
Speaker: Huang Cheng-Kang
 
 
What’s TSP?
A salesman, starting in one city, wishesto visit each of 
n
– 1 other cities once andonly once and return to the start.
In what order should he visit the cities tominimize the total distance traveled?
 
 
 The Algorithm
 The basic method:
Branch – break up the set of all tours
Bound – calculate a lower bound

Activity (9)

You've already reviewed this. Edit your review.
1 hundred reads
ratchagar a liked this
ratchagar a liked this
128bit liked this
onelesmana liked this
Angel Macry liked this
sudeepsonu liked this
sassy1234 liked this
krunal7369 liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->