Reoptimization of minimum and maximum traveling salesman's tours

Journal of Discrete Algorithms

Volumn 7, Issue 4, 2009, Pages 453-463

  Ausiello, Giorgio ^a   Escoffier, Bruno ^b,c   Monnot, Jérôme ^b,c   Paschos, Vangelis ^b,c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c CNRS   (France)

Author keywords

Approximation algorithms; Reoptimization; Traveling Salesman Problem

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMIZATION;

DISTANCE MATRICES; OPTIMUM SOLUTION; REOPTIMIZATION; TRAVELING SALESMAN;

TRAVELING SALESMAN PROBLEM;

EID: 70349786989     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2008.12.001     Document Type: Article

References (24)

1. Archetti C., Bertazzi L., and Speranza M.G. Reoptimizing the traveling salesman problem. Networks 42 3 (2003) 154-159
2. G. Ausiello, V. Bonifaci, B. Escoffier, Complexity and approximation in reoptimization, in: Cahier du LAMSADE 281, LAMSADE, Université Paris-Dauphine, 2008
3. Bartusch M., Möhring R.H., and Radermacher F.J. Scheduling project networks with resource constraints and time windows. Ann. Oper. Res. 16 (1988) 201-240
4. Bartusch M., Möhring R.H., and Radermacher F.J. A conceptional outline of a dss for scheduling problems in the building industry. Decision Support Syst. 5 (1989) 321-344
5. Bilò D., Böckenhauer H.-J., Hromkovic J., Královic R., Mömke T., Widmayer P., and Zych A. Reoptimization of Steiner trees. In: Gudmundsson J. (Ed). SWAT. Lecture Notes in Computer Science vol. 5124 (2008), Springer 258-269
6. H.-J. Böckenhauer, L. Forlizzi, J. Hromkovic, J. Kneis, J. Kupke, G. Proietti, P. Widmayer, Reusing optimal tsp solutions for locally modified input instances, in: 4th IFIP Int. Conf. on Theoretical Computer Science, 2006, pp. 251-270
7. Chen Z.-Z., Okamoto Y., and Wang L. Improved deterministic approximation algorithms for Max TSP. Inform. Process. Lett. 95 (2005) 333-342
8. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 338, Grad School of Industrial Administration, Canergie-Mellon University, Pittsburgh, 1976
9. Eppstein D., Galil Z., Italiano G.F., and Nissenzweig A. Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM 44 5 (1997) 669-696
10. B. Escoffier, M. Milanic, V.T. Paschos, Simple and fast reoptimizations for the Steiner tree problem, in: Cahier du LAMSADE 245, LAMSADE, Université Paris-Dauphine, 2007
11. Garey M.R., and Johnson D.S. Computer and Intractability: A Guide to the Theory of NP-Completeness (1979), W. H. Freeman
12. Gutin G., and Punnen A.P. The Traveling Salesman Problem and Its Variations. Combinatorial Optimization (2002), Kluwer Academic Publishers
13. D. Hartvigsen, Extensions of matching theory, PhD thesis, Carnegie-Mellon University, 1984
14. Hassin R., and Rubinstein S. A 7/8-approximation algorithm for metric Max TSP. Inform. Process. Lett. 81 5 (2002) 247-251
15. Henzinger M.R., and King V. Maintaining minimum spanning trees in dynamic graphs. In: Degano P., Gorrieri R., and Marchetti-Spaccamela A. (Eds). ICALP. Lecture Notes in Computer Science vol. 1256 (1997), Springer 594-604
16. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), Wiley
17. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Discrete Mathematics and Optimization (1985), Wiley
18. C.H. Papadimitriou, K. Steiglitz, Some complexity results for the traveling salesman problem, in: STOC'76, 1976, pp. 1-9
19. Papadimitriou C.H., and Yannakakis M. The traveling salesman problem with distances one and two. Math. Oper. Res. 18 (1993) 1-11
20. Rosenkrantz D.J., Stearns R.E., and Lewis II P.M. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6 3 (1977) 563-581
21. Sahni S., and Gonzalez T.F. P-complete approximation problems. J. ACM 23 3 (1976) 555-565
22. Schäffter M.W. Scheduling with forbidden sets. Discrete Appl. Math. 72 1-2 (1997) 155-166
23. Serdyukov A.I. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy 25 (1984) 80-86 (in Russian)
24. A. Zych, D. Bilò, P. Widmayer, Reoptimization of weighted graph and covering problems, in: WAOA, 2008, in press