|
Manthey, B. and Shankar Ram, L.
(2009)
Approximation algorithms for multi-criteria traveling salesman problems.
Algorithmica, 53 (1).
.
ISSN 0178-4617
*** ISI Impact 0,917 ***
Full text available as: Official URL: http://dx.doi.org/10.1007/s00453-007-9011-z  AbstractWe analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with  -triangle inequality. For this problem, we present a deterministic polynomial-time algorithm that achieves an approximation ratio of  and a randomized approximation algorithm that achieves a ratio of  . In particular, we obtain a  approximation for multi-criteria metric STSP. Then we show that multi-criteria cycle cover problems admit fully polynomial-time randomized approximation schemes. Based on these schemes, we present randomized approximation algorithms for STSP with -triangle inequality ratio  ), asymmetric TSP (ATSP) with -triangle inequality (ratio  ), STSP with weights one and two (ratio 4/3) and ATSP with weights one and two (ratio 3/2).
| Item Type: | Article |
|---|
| Research Group: | EWI-DMMP: Discrete Mathematics and Mathematical Programming |
|---|
| Research Program: | CTIT-IE&ICT: Industrial Engineering and ICT |
|---|
| ID Code: | 16093 |
|---|
| Status: | Published |
|---|
| Deposited On: | 05 October 2009 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| ISI Impact Factor: | 0,917 |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item
|
Nederlands
Contact
Sitemap
Search
Organisation
