Free Access
Issue
RAIRO-Oper. Res.
Volume 22, Number 3, 1988
Page(s) 301 - 308
DOI https://doi.org/10.1051/ro/1988220303011
Published online 06 February 2017
  • 1. N. CHRISTOFIDES, Worst-case Analysis of a New Heuristic for the Traveling Salesman Problem, Carnegie-Mellon Univ., Pittsburgh, 1976. [Google Scholar]
  • 2. W. F. DEMJANOW and W. N. MALOZEMOW, Einführung in Minimax-Probleme, Akad. Verlagsgesellschaft, Geest & Portig, Leipzig, 1975. [Google Scholar]
  • 3. A. M. FRIEZE, G. GALBIATI and F. MAFFIOLI, On the worst-case Performance of some Algorithms for the Asymmetric Traveling Salesman Problem, Networks, Vol. 12, 1982, pp. 23-39. [MR: 667262] [Zbl: 0478.90070] [Google Scholar]
  • 4. B. JEROMIN and F. KÖRNER, Zur Verschärfung der Christofides-Schranke für den Wert einer optimalen Tour des Rundreiseproblems, MOS, Ser. Optimization, Vol. 13, 1982, pp. 359-371. [MR: 668798] [Zbl: 0505.90051] [Google Scholar]
  • 5. B. JEROMIN and F. KÖRNER, On the Refinement of Bounds of Heuristic Algorithms for the Traveling Salesman Problem, Math. Prog., Vol. 32, 1985, pp. 114-117. [MR: 787747] [Zbl: 0564.90040] [Google Scholar]
  • 6. B. JEROMIN and F. KÖRNER, Triangle Inequality and Symmetry in Connection with the Assignment and the Traveling Salesman Problem, Preprint 07-11-87 TU Dresden, to appear in EJOR. [MR: 978495] [Zbl: 0671.90085] [Google Scholar]
  • 7. R. JONKER, R. KAAS and A. VOLGENANT, Datadependent bounds for Heuristics to Find a Minimum weight Hamiltonian Circuit, Oper. Res., Vol. 28, 1980, pp. 1219-1222. [MR: 589682] [Zbl: 0449.90093] [Google Scholar]
  • 8. R. JONKER and T. VOLGENANT, Transforming Asymmetric Into Symmetric Traveling Salesman Problems, Oper. Res. Letters, Vol. 2, 1983, pp. 161-163. [MR: 943039] [Zbl: 0529.90090] [Google Scholar]
  • 9. F. KÖRNER, On the Degree of Asymmetry in the Traveling Salesman Problem, Zast. Mat. Appl. Mat., Vol. 19, 1986, pp. 117-123. [EuDML: 267155] [MR: 897519] [Zbl: 0637.90096] [Google Scholar]
  • 10. E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN and D. B. SHMOYS, The Traveling Salesman Problem, John Wiley, Chichester, 1985. [MR: 811467] [Zbl: 0562.00014] [Google Scholar]
  • 11. W. SCHIEBEL, J. TERNO and G. UNGER, Ein Beitrag zur Klassifizierung von Rundreiseproblemen, M.O.S., Ser. Optimization, Vol. 10, 1979, pp. 523-528. [MR: 568629] [Zbl: 0429.90049] [Google Scholar]
  • 12. R. JONKER, Traveling Salesman and Assignment Algorithms: Design and Implementation, Dissertation, Amsterdam, 1986. [Google Scholar]
  • 13. A. VOLGENANT, Contributions to the Solution of the Traveling Salesman Problem and Related Problems, Dissertation, Amsterdam, 1987. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.