메뉴 건너뛰기




Volumn E89-D, Issue 8, 2006, Pages 2372-2379

An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity

Author keywords

Dynamic network flow; Evacuation problem; Quickest flow problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; GRAPH THEORY; INFORMATION THEORY; PROBLEM SOLVING;

EID: 33747836759     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e89-d.8.2372     Document Type: Article
Times cited : (35)

References (8)
  • 1
    • 0034138344 scopus 로고    scopus 로고
    • The quickest transshipment problem
    • Feb.
    • B. Hoppes and É. Tardos, "The quickest transshipment problem," Mathematics of Operations Research, vol.25, no. 1, pp.36-62. Feb. 2000.
    • (2000) Mathematics of Operations Research , vol.25 , Issue.1 , pp. 36-62
    • Hoppes, B.1    Tardos, É.2
  • 4
    • 27744532563 scopus 로고    scopus 로고
    • A tree partitioning problem arising from an evacuation problem in tree dynamic networks
    • Sept.
    • S. Mamada, T. Uno, K. Makino, and S. Fujishige, "A tree partitioning problem arising from an evacuation problem in tree dynamic networks." J. Operations Research Society of Japan, vol.48, no,3. pp. 196-206, Sept. 2005.
    • (2005) J. Operations Research Society of Japan , vol.48 , Issue.3 , pp. 196-206
    • Mamada, S.1    Uno, T.2    Makino, K.3    Fujishige, S.4
  • 5
    • 0036579526 scopus 로고    scopus 로고
    • Optimal sink location problem for dynamic flows in a tree network
    • May
    • S. Mamada, K. Makino. and S. Fujishige, "Optimal sink location problem for dynamic flows in a tree network," IEICE Trans. Fundamentals. vol.E85-A. no.5, pp.1020-1025, May 2002.
    • (2002) IEICE Trans. Fundamentals. , vol.E85-A , Issue.5 , pp. 1020-1025
    • Mamada, S.1    Makino, K.2    Fujishige, S.3
  • 6
    • 33746233379 scopus 로고
    • Resource allocation problems under submodular constraints
    • MIT Press, Cambridge, MA
    • T. Ibaraki and N. Katoh, "Resource allocation problems under submodular constraints," in Resource Allocation Problems: Algorithmic Approaches, pp. 144-176, MIT Press, Cambridge, MA. 1988.
    • (1988) Resource Allocation Problems: Algorithmic Approaches , pp. 144-176
    • Ibaraki, T.1    Katoh, N.2
  • 7
    • 33746223039 scopus 로고    scopus 로고
    • Nonlinear optimization with submodular constraints
    • Elsevier Scienee/North-Holland
    • S. Fujishige, "Nonlinear optimization with submodular constraints." in Submodular Functions and Optimization, 2nd ed., pp.223-250. Elsevier Scienee/North-Holland, 2005.
    • (2005) Submodular Functions and Optimization, 2nd Ed. , pp. 223-250
    • Fujishige, S.1
  • 8
    • 0039687324 scopus 로고
    • Lexicographically optimal base of a polymatroid with respect to a weight vector
    • May
    • S. Fujishige. "Lexicographically optimal base of a polymatroid with respect to a weight vector," Mathematics of Operations Research. vol.5, no.2, pp. 186-196. May 1980.
    • (1980) Mathematics of Operations Research , vol.5 , Issue.2 , pp. 186-196
    • Fujishige, S.1


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