메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 99, Issue 1-3, 2000, Pages 55-69
Tree partitioning under constraints - Clustering for vehicle routing problems
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0347560376     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00125-0     Document Type: Article
Times cited : (9)
References (17)
  • 1
    • 38249001009 scopus 로고
    • A shifting algorithm for constrained min-max partition on trees
    • Agasi E., Becker R., Perl Y. A shifting algorithm for constrained min-max partition on trees. Discrete Appl. Math. 45:1993;1-28.
    • (1993) Discrete Appl. Math. , vol.45 , pp. 1-28
    • Agasi, E.1    Becker, R.2    Perl, Y.3
  • 3
    • 0014856267 scopus 로고
    • An analysis of some graph theoretical cluster techniques
    • Augustson J., Minke J. An analysis of some graph theoretical cluster techniques. J. Assoc. Comp. Mach. 17:1970;571-588.
    • (1970) J. Assoc. Comp. Mach. , vol.17 , pp. 571-588
    • Augustson, J.1    Minke, J.2
  • 4
    • 0041875745 scopus 로고    scopus 로고
    • The simulated trading heuristic for solving vehicle routing problems
    • Bachem A., Hochstättler W., Malich M. The simulated trading heuristic for solving vehicle routing problems. Discrete Appl. Math. 65:1996;47-72.
    • (1996) Discrete Appl. Math. , vol.65 , pp. 47-72
    • Bachem, A.1    Hochstättler, W.2    Malich, M.3
  • 5
    • 0003111333 scopus 로고
    • The shifting technique for the partitioning of trees
    • Becker R., Perl Y. The shifting technique for the partitioning of trees. Discrete Appl. Math. 62:1995;15-34.
    • (1995) Discrete Appl. Math. , vol.62 , pp. 15-34
    • Becker, R.1    Perl, Y.2
  • 7
    • 0026840684 scopus 로고
    • A linear time algorithm for graph parititoning problems
    • Clark L., Shahrokhi F., Szekely L. A linear time algorithm for graph parititoning problems. Inform. Process. Lett. 42(1):1992;19-24.
    • (1992) Inform. Process. Lett. , vol.42 , Issue.1 , pp. 19-24
    • Clark, L.1    Shahrokhi, F.2    Szekely, L.3
  • 8
    • 0000419596 scopus 로고
    • Scheduling of vehicles from a central depot to a number of delivery points
    • Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12:1964;568-581.
    • (1964) Oper. Res. , vol.12 , pp. 568-581
    • Clarke, G.1    Wright, J.W.2
  • 10
    • 0042514092 scopus 로고
    • An efficient solvable graph partition problem to which many problems are reducible
    • Gavril F. An efficient solvable graph partition problem to which many problems are reducible. Inform. Process. Lett. 45:1993;285-290.
    • (1993) Inform. Process. Lett. , vol.45 , pp. 285-290
    • Gavril, F.1
  • 13
    • 0015093943 scopus 로고
    • Optimal network partitioning
    • Jensen P. Optimal network partitioning. Oper. Res. 19:1971;916.
    • (1971) Oper. Res. , vol.19 , pp. 916
    • Jensen, P.1
  • 14
    • 0000686934 scopus 로고
    • A linear tree partitiong algorithm
    • Kundu S., Misra J. A linear tree partitiong algorithm. SIAM J. Comput. 6:1977;151-154.
    • (1977) SIAM J. Comput. , vol.6 , pp. 151-154
    • Kundu, S.1    Misra, J.2
  • 16
    • 0041458220 scopus 로고
    • A spanning tree heuristic for regional clustering
    • Maravalle M., Simeone B. A spanning tree heuristic for regional clustering. Comm. Statist. Theory Methods. 24(3):1995;625-639.
    • (1995) Comm. Statist. Theory Methods , vol.24 , Issue.3 , pp. 625-639
    • Maravalle, M.1    Simeone, B.2
  • 17
    • 0008523779 scopus 로고
    • On a graph partition problem with applications to VLSI-layout
    • Sen A., Deng H., Guha S. On a graph partition problem with applications to VLSI-layout. Inform. Process. Lett. 43:1992;87.
    • (1992) Inform. Process. Lett. , vol.43 , pp. 87
    • Sen, A.1    Deng, H.2    Guha, S.3

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