메뉴 건너뛰기




Volumn 26, Issue 8, 1999, Pages 819-827

Improved solutions for the Chinese postman problem on mixed networks

Author keywords

Combinatorial optimization; Network routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

EID: 0033166648     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00092-6     Document Type: Article
Times cited : (10)

References (11)
  • 1
    • 0002293349 scopus 로고
    • Matching, Euler tours and the Chinese postman
    • Edmonds J, Johnson E. Matching, Euler tours and the Chinese postman. Mathematical Programming 1973;5:88-124.
    • (1973) Mathematical Programming , vol.5 , pp. 88-124
    • Edmonds, J.1    Johnson, E.2
  • 4
    • 38249000765 scopus 로고
    • On the mixed Chinese postman problem
    • Ralphs TK. On the mixed Chinese postman problem. Operations Research Letters 1993;14:123-7.
    • (1993) Operations Research Letters , vol.14 , pp. 123-127
    • Ralphs, T.K.1
  • 6
    • 0018495448 scopus 로고
    • The Chinese postman problem for mixed networks
    • Minieka E. The Chinese postman problem for mixed networks. Management Science 1979;25:643-8.
    • (1979) Management Science , vol.25 , pp. 643-648
    • Minieka, E.1
  • 7
    • 0039611814 scopus 로고    scopus 로고
    • An optimal algorithm for the mixed Chinese postman problem
    • Nobert Y, Picard JC. An optimal algorithm for the mixed Chinese postman problem. Networks 1996;27:95-108.
    • (1996) Networks , vol.27 , pp. 95-108
    • Nobert, Y.1    Picard, J.C.2
  • 10
    • 85013527076 scopus 로고
    • The Chinese postman problem for mixed graphs
    • Brucker P. The Chinese postman problem for mixed graphs. Lecture Notes in Computer Science 1981;(100):354-66.
    • (1981) Lecture Notes in Computer Science , Issue.100
    • Brucker, P.1
  • 11
    • 0029309563 scopus 로고
    • Algorithms for the Chinese postman problem on mixed networks
    • Pearn WL, Liu CM. Algorithms for the Chinese postman problem on mixed networks. Computers & Operations Research 1995;22(5):479-89.
    • (1995) Computers & Operations Research , vol.22 , Issue.5 , pp. 479-489
    • Pearn, W.L.1    Liu, C.M.2


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