Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics

Volumn 146, Issue 1, 2005, Pages 27-42

  Bazgan, Cristina ^a   Hassin, Refael ^b   Monnot, Jérôme ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithm; Differential ratio; TSP; VRP

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CUSTOMER SATISFACTION; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION ALGORITHMS; DIFFERENTIAL RATIO; TRAVELING SALESMAN PROBLEM (TSP); VEHICLE ROUTING PROBLEM (VRP);

PROBLEM SOLVING;

EID: 12444324543     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.07.003     Document Type: Article

References (27)

1. G. Ausiello, A. D'Atri, and M. Protasi Structure preserving reductions among convex optimization problems J. Comput. System Sci. 21 1980 136 153
2. C. Bazgan, Approximation of optimization problems and total function of NP, Ph.D. Thesis, Université Paris Sud, 1998, available at http://www.lamsade.dauphine.fr/ ∼ bazgan/Publications.html (in French).
3. M. Bellmore, and S. Hong Transformation of multi-salesmen problem to the standard traveling salesman problem J. Assoc. Comput. Mach. 21 1974 500 504
4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 338, Graduate School of Industrial Administration, CMU, 1976.
5. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver Combinatorial Optimization 1998 Wiley New York (Chapter 5.5)
6. M. Demange, and V. Paschos On an approximation measure founded on the links between optimization and polynomial approximation theory Theoret. Comput. Sci. 158 1996 117 141
7. R.-C. Duh, and M. Fürer Approximation of k-set cover by semi-local optimization Proceedings of the 29th Annual ACM Symposium on Theory of Computing 1996 256 264
8. L. Engebretsen, M. Karpinski, Approximation hardness of TSP with bounded metrics, Proceedings of the 28th International Colloquium of Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 2076, 2001, pp. 201-212.
9. G.N. Fredrickson, M.S. Hecht, and C.E. Kim Approximation algorithms for some routing problems SIAM J. Comput. 7 1978 178 193
10. M.R. Garey, and D.S. Johnson Computers and intractability. A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco, CA
11. M. Haimovich, and A.H.G. Rinnooy Kan Bounds and heuristics for capacitated routing problems Math. Oper. Res. 10 1985 527 542
12. M. Haimovich, A.H.G. Rinnooy Kan, L. Stougie, Analysis of heuristics for vehicle routing problems, North Holland, Amsterdam in: Vehicle Routing: Methods and Studies, Management Sci. Systems, 16, 1988, pp. 47-61.
13. M.M. Halldórsson, Approximating k-set cover and complementary graph coloring, Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, 1996, pp. 118-131.
14. D. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984.
15. R. Hassin, and S. Khuller z-approximations J. Algorithms 41 2001 429 442
16. R. Hassin, and S. Lahav Maximizing the number of unused colors in the vertex coloring problem Inform. Process. Lett. 52 1994 87 90
17. R. Hassin, and S. Rubinstein Better approximations for max TSP Inform. Process. Lett. 75 2000 181 186
18. D.G. Kirkpatrick, and P. Hell On the completeness of a generalized matching problem Proceedings of the 10th ACM Symposium on Theory and Computing 1978 240 245
19. C.-L. Li, D. Simchi-Levi, and M. Desrochers On the distance constrained vehicle routing problem Oper. Res. 40 1992 790 799
20. J. Monnot Differential approximation results for the traveling salesman and related problems Inform. Process. Lett. 82 2002 229 235
21. J. Monnot, The maximum Hamiltonian path problem with specified endpoint(s), European J. Oper. Res., 161 (2005) 721-735.
22. J. Monnot, V.Th. Paschos, S. Toulouse, Differential approximation results for the traveling salesman problem with distances 1 and 2, Proceedings of the 13th Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 2138, 2001, pp. 275-286.
23. C. Papadimitriou, and S. Vempala On the approximability of the traveling salesman problem Procceedings of the 32nd ACM Symposium on Theory and Computing 2000 126 133
24. C. Papadimitriou, and M. Yannakakis The traveling salesman problem with distances one and two Math. Oper. Res. 18 1993 1 11
25. J.F. Pekny, and D.L. Miller A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph ORSA J. Comput. 6 1994 68 81
26. S. Sahni, and T. Gonzalez P-complete approximation problems J. Assoc. Comput. Mach. 23 1976 555 565
27. E. Zemel Measuring the quality of approximate solution to zero-one programming problems Math. Oper. Res. 6 1981 319 332