Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 135-146

  Angel, Eric ^a   Bampis, Evripidis ^a   Gourvès, Laurent ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Approximation algorithms; Local search; Multicriteria TSP

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; PARETO PRINCIPLE;

COMBINATORIAL OPTIMIZATION;

TRAVELING SALESMAN PROBLEM;

EID: 0242692626     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00376-1     Document Type: Article

References (17)

1. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, New York.
2. Chandra B., Karloff H., Tovey C. New results on the old. k -opt algorithm for the TSP SIAM J. Comput. 28(6):1999;1998-2029.
3. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report, GSIA, Carnegie Mellon University, 1976.
4. Croes A. A method for solving traveling-salesman problems. Oper. Res. 5:1958;791-812.
5. Ehrgott M. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems. Vol. 491:2000;Springer, Berlin.
6. Gupta A., Warburton A. Approximation methods for multiple criteria traveling salesman problems, towards interactive and intelligent decision support systems. Sawaragi Y. Proc. 7th Internat. Conf. on Multiple Criteria Decision Making. 1986;211-217 Springer, Berlin.
7. Hassin R., Rubinstein S. A 7/8-approximation algorithm for metric Max TSP. Inform. Process. Lett. 82(5):2002;229-235.
8. Johnson D.S., McGeoch L.A. The traveling salesman problem: a case study in local optimization. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, New York.
9. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;Pluner, New York.
10. Khanna S., Motwani R., Sudan M., Vazirani V. On syntactic versus computational views of approximability. SIAM J. Comput. 28(1):1998;164-191.
11. Monnot J. Differential approximation results for the traveling salesman and related problems. Inform. Process. Lett. 82(5):2002;229-235.
12. Monnot J., Paschos V.Th., Toulouse S. Approximation algorithms for the traveling salesman problem. Math. Models Oper. Res. 56:2002;387-405.
13. Monnot J., Paschos V.Th., Toulouse S. Differential approximation results for the traveling salesman problem with distances 1 and 2. European J. Oper. Res. 145:2003;557-568.
14. C.H. Papadimitriou, S. Vempala, On the approximability of the traveling salesman problem, Proc. STOC'00, Portland, Oregon, 2000, pp. 126-133.
15. C.H. Papadimitriou, M. Yannakakis. The traveling salesman problem with distances one and two, in: Math. Oper. Res. 18 (1) (1993) 1-11.
16. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, Proc. 41th Ann. IEEE Symp. on Foundations of Computer Science, Redondo Beach, California, 2000, pp. 86-92.
17. Serdyukov A.I. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy. 25:1984;80-86.