On asymptotically optimal approach to the m-Peripatetic Salesman problem on random inputs

DOI10.1007/978-3-319-44914-2_11MaRDI QIDQ3133207zbMATH OpenOpenAlexFDO

Authors Eh. Kh. Gimadi, A. M. Istomin, O. Yu. Tsidulko

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_11

zbMATH Keywords

asymptotically optimal algorithmm-PSPperformance guaranteesrandom inputsshifted exponential distributionuniform distribution

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
• Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above
• Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP
• On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
• Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations

Cited in

(5)

• The undirected \(m\)-capacitated peripatetic salesman problem
• Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above
• An asymptotically optimal algorithm for the m-peripatetic salesman problem on random inputs with discrete distribution
• Safe and secure vehicle routing: a survey on minimization of risk exposure
• Edge-disjoint spanning trees of arbitrary bounded diameter on random inputs

This page was built for publication: On asymptotically optimal approach to the m-Peripatetic Salesman problem on random inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133207)