Approximating the asymmetric profitable tour Online publication date: Wed, 02-May-2012
by Viet Hung Nguyen; Thi Thu Thuy Nguyen
International Journal of Mathematics in Operational Research (IJMOR), Vol. 4, No. 3, 2012
Abstract: We study the version of the asymmetric prize collecting travelling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. In Dell'Amico et al. (1995), the authors defined it as the Profitable Tour Problem (PTP). We present an (1 + ⌈log(n)⌉)-approximation algorithm for the asymmetric PTP with n is the vertex number. The algorithm that is based on Frieze et al.'s heuristic for the asymmetric travelling salesman problem as well as a method to round fractional solutions of a linear programming relaxation to integers (feasible solution for the original problem), represents a directed version of the Bienstock et al.'s (1993) algorithm for the symmetric PTP.
Online publication date: Wed, 02-May-2012
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org