Skip to main content
SpringerLink
Log in

On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

An efficient algorithm A with a guaranteed error estimate is presented for solving the problem of finding several edge-disjoint Hamiltonian circuits (traveling salesman tours) of maximum weight in a complete weighted undirected graph in a multidimensional Euclidean space ℝk. The time complexity of the algorithm is O(n 3). The number of traveling salesman tours for which the algorithm is asymptotically optimal is established.

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. A. A. Ageev, A. E. Baburin, and E. Kh. Gimadi, Diskretn. Anal. Issled. Oper., Ser. 1, 13(2), 11 (2006); English transl.: J. Appl. Indust. Math. 1 (2), 142 (2007).

    MathSciNet  Google Scholar 

  2. A. A. Ageev and A. V. Pyatkin, Diskretn. Anal. Issled. Oper. 16(4), 3 (2009); English transl.: in Approximation and Online Algorithms (Springer-Verlag, Berlin, 2008), Ser. Lecture Notes in Comp. Sci., Vol. 4927, pp. 103–115.

    MathSciNet  Google Scholar 

  3. A. E. Baburin, E. Kh. Gimadi, and N. M. Korkishko, Diskretn. Anal. Issled. Oper., Ser. 2, 11(1), 11 (2004); English transl. in Operations Research Proceedings (Springer-Verlag, Berlin, 2003), pp. 316–323.

    MATH  MathSciNet  Google Scholar 

  4. A. E. Baburin and E. Kh. Gimadi, Diskretn. Anal. Issled. Oper., Ser. 1, 13(3), 3 (2006); English transl.: J. Appl. Indust. Math. 1 (4), 418 (2007).

    MathSciNet  Google Scholar 

  5. E. Kh. Gimadi, Yu. V. Glazkov, and A. N. Glebov, Diskretn. Anal. Issled. Oper., Ser. 2, 14(2), 41 (2007); English transl.: J. Appl. Indust. Math. 3 (1), 46 (2009).

    MathSciNet  Google Scholar 

  6. E. Kh. Gimadi, in Optimization Methods and Their Applications: Proc. 12th Baikal Internat. Conf. (Irkutsk, 2001), Vol. 1, pp. 117–124 [in Russian].

    Google Scholar 

  7. E. Kh. Gimadi, Trudy Inst. Mat. Mekh. UrO RAN 13(1), 23 (2008).

    MathSciNet  Google Scholar 

  8. V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures on Graph Theory (Nauka, Moscow, 1990) [in Russian].

    MATH  Google Scholar 

  9. O. Ore, Theory of Graphs (Amer. Math. Soc., Providence, 1962; Nauka, Moscow, 1980).

    MATH  Google Scholar 

  10. A. I. Serdyukov, in Controlled Systems. Issue 27: Methods of Integer Optimization (Inst. Matem. Sibirsk. Otdel. AN SSSR, Novosibirsk, 1987), pp. 79–87 [in Russian].

    Google Scholar 

  11. A. E. Baburin, F. Della Croce, E. Kh. Gimadi, et al., Discrete Appl. Math. 157(9), 1988 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  12. H. N. Gabow, in Proc. 15th Annual ACM Symposium on Theory of Computing (ACM, New York, 1983), pp. 448–456.

    Google Scholar 

  13. J. E. Hopcroft and R. M. Karp, SIAM J. Comput. 2, 225 (1973).

    Article  MATH  MathSciNet  Google Scholar 

  14. J. B. J. M. De Kort, European J. Oper. Res. 70, 229 (1993).

    Article  MATH  Google Scholar 

  15. J. B. J. M. De Kort, Optimization 22(1), 113 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Krarup, in Combinatorial Programming: Methods and Applications: Proc. NATO Advanced Study Inst., Versailles, 1974 (D. Reidel, Dordrecht, 1975), pp. 173–178.

    Google Scholar 

  17. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Ed. by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys (Wiley, Chichester, 1985).

    Google Scholar 

  18. The Traveling Salesman Problem and Its Variations, Ed. by G. Gutin and A. P. Punnen (Kluwer, Dordrecht, 2002).

    MATH  Google Scholar 

  19. R. W. Calvo and R. Cordone, Computers & Oper. Res. 30(9), 1269 (2003).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, pr. Koptyuga 4, Novosibirsk, 630090, Russia

    A. E. Baburin & E. Kh. Gimadi

Authors
  1. A. E. Baburin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. E. Baburin.

Additional information

Original Russian Text © A.E. Baburin, E.Kh.Gimadi, 2010, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Vol. 16, No. 3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baburin, A.E., Gimadi, E.K. On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space. Proc. Steklov Inst. Math. 272 (Suppl 1), 1–13 (2011). https://doi.org/10.1134/S0081543811020015

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543811020015

Keywords

Search

Navigation