Skip to main content
SpringerLink
Log in

Maximum travelling salesman problem

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We present different types of techniques for designing algorithms with worst-case performances for the Maximum Travelling Salesman Problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Jenkyns T (1979) Greedy travelling salesman's problem Networks. 9:363–373

    MATH  MathSciNet  Google Scholar 

  2. Kovalev MM, Kotov VM (1981) An analysis of greedy solution for travelling salesman problem. USSR Comput Math and Math Phys N4:1035–1038

    MathSciNet  Google Scholar 

  3. Fisher M, Nemhauser G, Wolsey L (1979) An analysis of approximations for finding a maximum weight Hamiltonian circuit. Oper Res 4:799–809

    MathSciNet  Google Scholar 

  4. Kovalev MM, Kotov VM (1982) Suboptimal algorithms for solving travelling salesman problem. VINITI N 2403-82:31

    Google Scholar 

  5. Kovalev MM, Kotov VM (1984) An analysis of algorithms for constructing Hamiltonian circuit with maximum weight (russ) Izv AN BSSR. N4:45–50

    MathSciNet  Google Scholar 

  6. Kostochka A, Serdukov A (1985) Polynomial algorithms with worst-case performances 3/4 and 5/6 for maximum travelling salesman problem (russ). Controlled System (Novosibirsk) 26:55–598

    Google Scholar 

  7. Kovalev MM, Kotov VM (1986) Worst-case performances of series of heuristics (russ.). Izv Byelorussian Univ 3(1):44–48

    MATH  MathSciNet  Google Scholar 

  8. Serdukov A (1987) An asymptotically exact algorithm for maximum travelling salesman problem in the Euclidean space (russ). Controlled System (Novosibirsk) 27:79–87

    Google Scholar 

  9. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, GSIA, Carnegie-Mellon University

  10. Rozenkrantz D, Stearns R, Lewis P (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6:563–581

    Article  MathSciNet  Google Scholar 

  11. Serdukov A (1984) An algorithm with performance for maximum traveling salesman problem (russ). Controlled System (Novosibirsk) 25:80–86

    Google Scholar 

  12. Kovalev M, Kotov V (1985) Series of greedy algorithms (russ). Diskrete Optimierung Jena Universitat 93–103

  13. Friese A, Galbiaty G, Maffioli F (1982) On the worst-case performance of some algorithms for asymmetric travelling salesman problem. Networks 12:23–39

    MathSciNet  Google Scholar 

  14. Papadimitriou C, Yannakakis M (1993) The travelling salesman problem with distances one and two. Math of Oper Res 18:1–11

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Belarussian State University, Faculty of Applied Mathematics and Informatics, Prospekt F. Skarina 4, 220050, Minsk, Belarus

    Vladimir Kotov & Michail Kovalev

Authors
  1. Vladimir Kotov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michail Kovalev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by Byelarussian Fundamental Science Found and DAAD

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kotov, V., Kovalev, M. Maximum travelling salesman problem. Mathematical Methods of Operations Research 43, 169–181 (1996). https://doi.org/10.1007/BF01680370

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01680370

Key words

Search

Navigation