Restricted Delivery Problems on a Network

Networks

Volumn 29, Issue 4, 1997, Pages 205-216

  Arkin, Esther M ^a   Hassin, Refael ^b   Klein, Limor ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithm; Traveling salesman problem

Indexed keywords

EID: 0347140009     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-J     Document Type: Article

References (21)

1. S. Anily and R. Hassin, The swapping problem. Networks 12 (1992) 419-433.
2. S. Anily and G. Mosheiov, The traveling salesman problem with delivery and backhauls. Oper. Res. Lett. 16 (1994) 11-18.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA (1992) 14-23.
4. P. Chalasani, Delivery problems and matroid intersection (1995).
5. J. A. Chisman, The clustered traveling salesman problem. Comput. Oper. Res. 2 (1975) 115-119.
6. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, GSIA, Carnegie-Mellon University (1976).
7. N. Christofides and I. Colloff, The rearrangement of items in a warehouse. Oper. Res. 21 (1973) 577-589.
8. M. Dror, H. Stern, and P. Trudeau, Postman tour on graph with precedence relation on arc. Networks 17 (1987) 283-294.
9. M. Gendreau, A. Hertz, and G. Laporte, An approximation algorithm for the traveling salesman problem with backhauls. Technical Report CRT-95-01, Center for Research on Transportation, University of Montreal (1995). Oper. Res., to appear.
10. M. Gendreau, G. Laporte, and J.-Y. Potvin, Heuristics for the clustered traveling salesman problem. Technical Report CRT-94-54, Center for Research on Transportation, University of Montreal (1994). Combin. Optim., to appear.
11. G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation algorithms for some routing problems. SIAM J. Comput. 7(2) (1978) 178-190.
12. J. A. Hoogeveen, Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Oper. Res. Lett. 10(5) (1991) 291-295.
13. D. S. Johnson and C. H. Papadimitriou, Performance guarantees for heuristics. The Traveling Salesman Problem (E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, Eds.). Wiley, New York (1985) Chap. 5.
14. K. Jongens and T. Volgenat, The symmetric clustered traveling salesman problem. Eur. J. Oper. Res. 19 (1985) 68-75.
15. E. Lawler, Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976).
16. C.-L. Li, S. T. McCormick, and D. Simchi-Levi, The point-to-point delivery and connection problems: Complexity and algorithms. Discr. Appl. Math. 36 (1992) 267-292.
17. S. Lin and B. W. Kernighan, An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 (1973) 498-516.
18. J.-H. Lin and J. S. Vitter, ∈-Approximations with minimum packing constraint violation. Proceedings of 24th STOC (1992) 771-782.
19. F. C. J. Lokin, Procedures for the traveling salesman problem with additional constraints. Eur. J. Oper. Res. 3 (1978) 135-141.
20. A. K. Mittal, Optimal rearrangement of objects. PhD thesis (1975).
21. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II, An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6 (1977) 563-581.