Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The design and analysis of computer algorithms , Reading , Mass : Addison-Wesley .
   Google Scholar
• Christofides , N. 1972 . Bounds for the Traveling-Salesman Problem . Opns. Res , 20 ( 5 ) : 1044 – 1056 .
   Web of Science ®Google Scholar
• Christqfides , N. 1975 . Graph Theory , London , New York : Academic Press . San Francisco
   Google Scholar
• Gabovic , E. 1976 . Konstante Probleme der Diskreten Optimierung auf Permutations-mengen . Kibernetika , 5 : 128 – 134 .
   Google Scholar
• Held , M. and Karp , R.M. 1970 . The traveling-salesman problem and minimum spanning trees . Opns. Res , 18 : 1138 – 1162 .
   Web of Science ®Google Scholar
• Held , M. and Karp , R.M. 1971 . The traveling-salesman problem and minimum spanning trees . part II, Math. Progr , 1 : 6 – 25 .
   Google Scholar
• Karp , R.M. 1977 . Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane . Math, of Opns. Res , 2 : 209 – 224 .
   Google Scholar
• Schiebel , W. , Terno , J. and Unger , G. 1979 . Ein Beitrag zur Kiassifizierung von Rundreise-problemen . Math. Oper. und Statistik, Series Optimization , 10 ( 4 ) : 523 – 528 .
   Google Scholar
• Smith , T.H.C. , Srinivasan , V. and Thompson , G.L. 1977 . Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems . Ann. Discrete Math , 1 ( 4 ) : 495 – 506 .
   Google Scholar