Art
J-GLOBAL ID:201702275162821147   Reference number:17A0011208

EXPERIMENTAL ANALYSES OF THE EVACUATION PLANNING MODEL USING LEXICOGRAPHICALLY QUICKEST FLOW

辞書式最速流による避難計画作成モデルの実験的解析
Author (6):
Material:
Volume: 59  Page: 86-105  Publication year: Dec. 2016 
JST Material Number: L5172A  ISSN: 1349-8940  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  Language: JAPANESE (JA)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

JST classification (2):
JST classification
Category name(code) classified by JST.
General  ,  Network methods 
Reference (18):
  • [1] R.K. Ahuja and J.B. Orlin: A fast and simple algorithm for the maximum flow problem. Operations Research, 37-5 (1989), 748-759.
  • [2] E.A. Dinic: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady, 11 (1970), 1277-1280.
  • [3] L.R. Ford Jr. and D.R. Fulkerson: Maximal flow through a network. Canadian Journal of Mathematics, 8 (1956), 399-404.
  • [4] L.R. Ford Jr. and D.R. Fulkerson: Constructing maximal dynamic flows from static flows. Operations Research Letters, 6 (1958), 419-433.
  • [5] L.R. Ford and D.R. Fulkerson: Flows in Networks (Princeton University Press, 1962).
more...
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page