A Dynamic Programming Algorithm for the Travelling Salesman Problem Moshe Sn iedovich Department of Mathematics The University of Melbourne P a r k v i l l e , V I C 3052, A u s t r a l i a E-maih moshe@mundoe, m a t h s , mu. oz. a u f(v,c) = x ¢ Y(v) { rnin d (c,x) + f ( v [.J {x} ,x)} (3) c ¢ r E { l , 2, ..., N} with f ( { l , 2, ..., IV},c) = d(c,O), c ¢ {1, 2, ..., N-} where Y(v): = {x: x ¢ { 1, 2, ..., N ) , x~v) , (4) T h e t r a v e l l i n g s a l e s m a n p r o b l e m (TSP) is cons i d e r e d "...the most prominent unsolved combinatorial optimization problems .._" [1, p. 2]. A n d to b e s u r e , t h e b e s t t h a t e x i s t i n g s o l u t i
/lp/association-for-computing-machinery/a-dynamic-programming-algorithm-for-the-traveling-salesman-problem-egOTBGVFq0