search

arjunmehta94 / 170project

170 final project NPTSP
0 stars 0 forks source link

Looking at possible ways to solve TSP (leave links/comments) #1

Open arjunmehta94 opened 9 years ago

arjunmehta94 commented 9 years ago

http://www.wired.com/2013/01/traveling-salesman-problem/

arjunmehta94 commented 9 years ago

http://www.personal.kent.edu/~rmuhamma/Compgeometry/MyCG/CG-Applets/TSP/notspcli.htm

arjunmehta94 commented 9 years ago

http://sarielhp.org/research/CG/applets/tsp/TspAlg.html

arjunmehta94 commented 9 years ago

http://www.csd.uoc.gr/~hy583/papers/ch11.pdf

arjunmehta94 commented 9 years ago

upper bound - nearest neighbor algorithm (greedy). lower bound - delete a vertex, find the MST, then add the lightest edge to deleted vertex.