Abstract
In this paper we present two new polynomial algorithms for the asymmetric version of the m-Peripatetic Salesman Problem (m-APSP) which consists in finding m edge-disjoint Hamiltonian circuits of extremal total weight in a complete weighted digraph. The first algorithm solves the asymmetric 2-PSP on maximum. Its approximation ratio is equal to 2/3. The second algorithm deals with the minimization version of the asymmetric m-PSP on random instances. For this algorithm conditions for asymptotically exactness are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
