Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 6, Pages 11–20 (Mi da798)  
This article is cited in 3 scientific papers (total in 3 papers)

$2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem

A. N. Glebov, D. Zh. Zambalaeva, A. A. Skretneva

S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Full-text PDF (257 kB) Citations (3)
References:
PDF
HTML
Abstract: We present a polynomial approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem which consists in finding two edge-disjoint Hamiltonian circuits of maximum total weight in a complete weighted digraph. The algorithm guarantees an approximation ratio of $2/3$ in cubic running time. Ill. 5, bibliogr. 7.
Keywords: traveling salesman problem, peripatetic salesman problem, polynomial algorithm, guaranteed ratio, directed graph.
Received: 02.12.2013
Revised: 11.07.2014
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 1, Pages 61–67
DOI: https://doi.org/10.1134/S199047891501007X
Bibliographic databases:
Document Type: Article
UDC: 519.172.2
Language: Russian
Citation: A. N. Glebov, D. Zh. Zambalaeva, A. A. Skretneva, “$2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem”, Diskretn. Anal. Issled. Oper., 21:6 (2014), 11–20; J. Appl. Industr. Math., 9:1 (2015), 61–67
Citation in format AMSBIB
\Bibitem{GleZamSkr14}
\by A.~N.~Glebov, D.~Zh.~Zambalaeva, A.~A.~Skretneva
\paper $2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 6
\pages 11--20
\mathnet{http://mi.mathnet.ru/da798}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3408909}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 1
\pages 61--67
\crossref{https://doi.org/10.1134/S199047891501007X}
Linking options:
  • https://www.mathnet.ru/eng/da798
  • https://www.mathnet.ru/eng/da/v21/i6/p11
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:228
    Full-text PDF :195
    References:26
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024