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, 2017, Volume 24, Issue 3, Pages 5–19
DOI: https://doi.org/10.17377/daio.2017.24.551 (Mi da872) 		 
This article is cited in 2 scientific papers (total in 2 papers)

An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution

E. Kh. Gimadiab, O. Yu. Tsidulkoab

a Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
b Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Full-text PDF (339 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2017.24.551
Abstract: We consider the $m$-Peripatetic Salesman Problem ($m$-PSP) on random inputs with discrete distribution function. In this paper we present a polynomial approximation algorithm which, under certain conditions, with high probability (w.h.p.) gives optimal solution for both the $m$-PSP on random inputs with identical weight functions and the $m$-PSP with different weight functions. Illustr. 1, bibliogr. 27.
Keywords: $m$-Peripatetic Salesman Problem, asymptotically optimal algorithm, random inputs, discrete distribution.
Funding agency Grant number
Russian Science Foundation 16-11-10041
Received: 03.08.2016
Revised: 13.10.2016
English version:
Journal of Applied and Industrial Mathematics, 2017, Volume 11, Issue 3, Pages 354–361
DOI: https://doi.org/10.1134/S1990478917030061
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: E. Kh. Gimadi, O. Yu. Tsidulko, “An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution”, Diskretn. Anal. Issled. Oper., 24:3 (2017), 5–19; J. Appl. Industr. Math., 11:3 (2017), 354–361
Citation in format AMSBIB
\Bibitem{GimTsi17}
\by E.~Kh.~Gimadi, O.~Yu.~Tsidulko
\paper An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 3
\pages 5--19
\mathnet{http://mi.mathnet.ru/da872}
\crossref{https://doi.org/10.17377/daio.2017.24.551}
\elib{https://elibrary.ru/item.asp?id=29869480}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 3
\pages 354--361
\crossref{https://doi.org/10.1134/S1990478917030061}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85028554513}
Linking options:
  • https://www.mathnet.ru/eng/da872
  • https://www.mathnet.ru/eng/da/v24/i3/p5
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:275
    Full-text PDF :55
    References:43
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024