메뉴 건너뛰기
Operations Research Letters
Volumn 24, Issue 1, 1999, Pages 29-35
5/3-Approximation algorithm for the clustered traveling salesman tour and path problems
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CRITICAL PATH ANALYSIS; PROBLEM SOLVING;
EID: 0032631907     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(98)00046-7     Document Type: Article
Times cited : (36)
References (10)
  • 1
    • 0347140009 scopus 로고
    • Restricted delivery problems on a network
    • E.M. Arkin R. Hassin L. Klein Restricted delivery problems on a network Networks 29 1994 205 216
    • (1994) Networks , vol.29 , pp. 205-216
    • Arkin, E.M.1    Hassin, R.2    Klein, L.3
  • 2
    • 0001201888 scopus 로고
    • The clustered traveling salesman problem
    • J.A. Chisman The clustered traveling salesman problem Comput. Oper. Res. 2 1975 115 119
    • (1975) Comput. Oper. Res. , vol.2 , pp. 115-119
    • Chisman, J.A.1
  • 3
    • 85120123647 scopus 로고    scopus 로고
    • N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
  • 4
    • 13444308122 scopus 로고
    • Tight bounds for christofides’ traveling salesman heuristic
    • G. Cornuéjols G.L. Nemhauser Tight bounds for christofides’ traveling salesman heuristic Math. Programming 14 1978 116 121
    • (1978) Math. Programming , vol.14 , pp. 116-121
    • Cornuéjols, G.1    Nemhauser, G.L.2
  • 5
    • 0031186818 scopus 로고    scopus 로고
    • An approximation algorithm for the traveling salesman problem with backhauls
    • M. Gendreau A. Hertz G. Laporte An approximation algorithm for the traveling salesman problem with backhauls Oper. Res. 45 1997 639 641
    • (1997) Oper. Res. , vol.45 , pp. 639-641
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 6
    • 0010211184 scopus 로고    scopus 로고
    • Heuristic for the clustered traveling salesman problem
    • M. Gendreau G. Laporte J.-Y. Potvin Heuristic for the clustered traveling salesman problem Combin. Optim. 1 1996 41 56
    • (1996) Combin. Optim. , vol.1 , pp. 41-56
    • Gendreau, M.1    Laporte, G.2    Potvin, J.-Y.3
  • 7
    • 85120113738 scopus 로고    scopus 로고
    • N. Guttman-Beck, R. Hassin, S. Khuller, B. Raghavachari, Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem, Working Paper, Department of Statistics and Operations Research, Tel-Aviv University, 1997.
  • 8
    • 0001137783 scopus 로고
    • Analysis of Christofides’ heuristic: Some paths are more difficult than cycles
    • J.A. Hoogeveen Analysis of Christofides’ heuristic: Some paths are more difficult than cycles Oper. Res. Lett. 10 1991 291 295
    • (1991) Oper. Res. Lett. , vol.10 , pp. 291-295
    • Hoogeveen, J.A.1
  • 9
    • 0000852186 scopus 로고
    • Procedures for the traveling salesman problem with additional constraints
    • F.C.J. Lokin Procedures for the traveling salesman problem with additional constraints European J. Oper. Res. 3 1978 135 141
    • (1978) European J. Oper. Res. , vol.3 , pp. 135-141
    • Lokin, F.C.J.1
  • 10
    • 85120123404 scopus 로고    scopus 로고
    • C.H. Papadimitriou, K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.