메뉴 건너뛰기




Volumn 48, Issue 3, 2005, Pages 196-206

A tree partitioning problem arising from an evacuation problem in tree dynamic networks

Author keywords

Algorithm; Combinatorial optimization; Dynamic flow; Evacuation problem; Partitioning problem; Tree network

Indexed keywords


EID: 27744532563     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.48.196     Document Type: Article
Times cited : (15)

References (18)
  • 2
    • 0001251884 scopus 로고
    • Shifting algorithms for tree partitioning with general weighting functions
    • R. Becker and Y. Perl: Shifting algorithms for tree partitioning with general weighting functions. Journal of algorithms, 4 (1983), 101-120.
    • (1983) Journal of Algorithms , vol.4 , pp. 101-120
    • Becker, R.1    Perl, Y.2
  • 3
    • 12744254391 scopus 로고    scopus 로고
    • Cellular automaton approach to pedestrian dynamics - Applications
    • (M. Schreckenberg and S.D. Sharma, eds., Springer)
    • C. Burstedde, A. Kirchner, K. Klauck, A. Schadschneider, and J. Zittartz: Cellular automaton approach to pedestrian dynamics - Applications. In: Pedestrian and Evacuation Dynamics (M. Schreckenberg and S.D. Sharma, eds., Springer, 2002), 87-97.
    • (2002) Pedestrian and Evacuation Dynamics , pp. 87-97
    • Burstedde, C.1    Kirchner, A.2    Klauck, K.3    Schadschneider, A.4    Zittartz, J.5
  • 4
    • 0034022322 scopus 로고    scopus 로고
    • An approach to modelling time-varying flows on congested networks
    • M. Carey and E. Subrahmanian: An approach to modelling time-varying flows on congested networks. Transportation Research, B 34 (2000), 157-183.
    • (2000) Transportation Research , vol.34 B , pp. 157-183
    • Carey, M.1    Subrahmanian, E.2
  • 6
    • 0032036222 scopus 로고    scopus 로고
    • A model and an algorithm for the dynamic user-optimal route choice problem
    • H.K. Chen and C.F. Hsueh: A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Research, B 32 (1998), 219-234.
    • (1998) Transportation Research , vol.32 B , pp. 219-234
    • Chen, H.K.1    Hsueh, C.F.2
  • 8
    • 0032178214 scopus 로고    scopus 로고
    • Efficient continuous-time dynamic network flow algorithms
    • L. Fleischer and É. Tardos: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23 (1998), 71-80.
    • (1998) Operations Research Letters , vol.23 , pp. 71-80
    • Fleischer, L.1    Tardos, É.2
  • 9
    • 0141744455 scopus 로고    scopus 로고
    • Simulating evacuation and circulation in planes, trains, buildings and ships using the EXODUS software
    • (M. Schreckenberg and S.D. Sharma, eds., Springer)
    • E.R. Galea: Simulating evacuation and circulation in planes, trains, buildings and ships using the EXODUS software. In: Pedestrian and Evacuation Dynamics (M. Schreckenberg and S.D. Sharma, eds., Springer, 2002), 203-225.
    • (2002) Pedestrian and Evacuation Dynamics , pp. 203-225
    • Galea, E.R.1
  • 11
    • 3042576795 scopus 로고    scopus 로고
    • Mathematical modelling of evacuation problems: A state of the art
    • (Springer)
    • H.W. Hamacher and S.A. Tjandra: Mathematical modelling of evacuation problems: A state of the art, In: Pedestrian and Evacuation Dynamics (Springer, 2002), 227-266.
    • (2002) Pedestrian and Evacuation Dynamics , pp. 227-266
    • Hamacher, H.W.1    Tjandra, S.A.2
  • 13
    • 0026072854 scopus 로고
    • Dynamic traffic assignment for urban road networks
    • B.N. Janson: Dynamic traffic assignment for urban road networks. Transportation Research, B 25 (1991), 143-161.
    • (1991) Transportation Research , vol.25 B , pp. 143-161
    • Janson, B.N.1
  • 14
    • 0036579526 scopus 로고    scopus 로고
    • Optimal sink location problem for dynamic flows in a tree network
    • S. Mamada, K. Makino, and S. Fujishige: Optimal sink location problem for dynamic flows in a tree network. IEICE Trans. Fundamentals, E85-A (2002), 1020-1025.
    • (2002) IEICE Trans. Fundamentals , vol.E85-A , pp. 1020-1025
    • Mamada, S.1    Makino, K.2    Fujishige, S.3
  • 18
    • 0023396415 scopus 로고
    • A dynamic space-time network flow model for city traffic congestion
    • D.J. Zawack and G.L. Thompson: A dynamic space-time network flow model for city traffic congestion. Transportation Science, 21 (1987), 153-162.
    • (1987) Transportation Science , vol.21 , pp. 153-162
    • Zawack, D.J.1    Thompson, G.L.2


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