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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 39-48

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

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

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION;

BI-CRITERIA; LINEAR TIME; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MULTICRITERIA OPTIMIZATION; PARETO CURVE; PERFORMANCE GUARANTEES; TSP (1 ,2);

TRAVELING SALESMAN PROBLEM;

EID: 26844452976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_5     Document Type: Article

References (14)

1. N. Christofides. Worst-Case analysis of a new heuristic for the traveling salesman problem. Technical Report, GSIA, Carnegie Mellon University, 1976.
2. R.M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), Pluner, NY, 1972.
3. E. Aarts and J.K. Lenstra, Local search in combinatorial optimization, John Wiley and Sons, 1997.
4. D.S. Johnson and L.A. McGeoch, The traveling salesman problem: a case study in Local Optimization, chapter in Local search in combinatorial optimization, E. Aarts and J.K. Lenstra (eds.), John Wiley and Sons, 1997.
5. M. Ehrgott Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 491, Springer, 2000.
6. B. Chandra, H. Karloff and C. Tovey, New results on the old k-opt algorithm for the TSP, SIAM Journal on Computing, 28(6), 1998-2029, 1999.
7. S. Khanna, R. Motwani, M. Sudan and V. Vazirani, On syntactic versus computational views of approximability, SIAM Journal on Computing, 28(1), 164-191, 1998.
8. J. Monnot, Differential approximation results for the traveling salesman and related problems, Information Processing Letters, 82(5), 229-235, 2002.
9. J. Monnot, V. Th. Paschos and S. Toulouse, Differential approximation results for the traveling salesman problem with distances 1 and 2, European Journal of Operational Research, 145, 557-568, 2003.
10. A.I. Serdyukov, An algorithm with an estimate for the traveling salesman problem of the maximum, Upravlyaemye Sistemy, 25, 80-86, 1984.
11. C.H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, Proceedings 41th Annual IEEE Symposium on Foundations of Computer Science, 86-92, 2000.
12. C.H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. In Mathematics of Operations Research, 18(1), 1-11, 1993.
13. C.H. Papadimitriou, S. Vempala. On the approximability of the traveling salesman problem. Proc. STOC'00, 126-133, 2000.
14. A. Gupta, A. Warburton. Approximation methods for multiple criteria traveling salesman problems, Towards Interactive and Intelligent Decision Support Systems, Proc. of the 7th International Conference on Multiple Criteria Decision Making, (Y. Sawaragi Ed.), Springer Verlag, 211-217, 1986.