메뉴 건너뛰기
Omega
Volumn 31, Issue 4, 2003, Pages 269-273
On the maximum benefit Chinese Postman Problem
Author keywords

Chinese Postman Problem; Rural Postman Problem; Upper bound
Indexed keywords

EID: 0038647378     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(03)00051-3     Document Type: Article
Times cited : (18)
References (5)
  • 1
    • 0004169767 scopus 로고
    • An algorithm for the rural postman problem
    • Imperial College Report IC-OR
    • Christofides N, Campos V, Corberan A, Mota E. An algorithm for the rural postman problem. Imperial College Report IC-OR, 1981.
    • (1981)
    • Christofides, N.1    Campos, V.2    Corberan, A.3    Mota, E.4
  • 2
    • 84987039902 scopus 로고
    • Postman tour on a graph with precedence relation on arcs
    • Dror M. Stern H. Trudeau P. Postman tour on a graph with precedence relation on arcs Networks 17 1987 283-294
    • (1987) Networks , vol.17 , pp. 283-294
    • Dror, M.1    Stern, H.2    Trudeau, P.3
  • 3
    • 0019609540 scopus 로고
    • Capacitated arc routing problems
    • Golden B. Wong R. Capacitated arc routing problems Networks 11 1981 305-315
    • (1981) Networks , vol.11 , pp. 305-315
    • Golden, B.1    Wong, R.2
  • 4
    • 0027560974 scopus 로고
    • The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
    • Malandraki C. Daskin M.S. The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem European Journal of Operational Research 65 1993 218-234
    • (1993) European Journal of Operational Research , vol.65 , pp. 218-234
    • Malandraki, C.1    Daskin, M.S.2
  • 5
    • 0028547128 scopus 로고
    • Solvable cases of the k-person Chinese postman problem
    • Pearn W.L. Solvable cases of the k-person Chinese postman problem Operations Research Letters 16 1994 241-244
    • (1994) Operations Research Letters , vol.16 , pp. 241-244
    • Pearn, W.L.1

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