Art
J-GLOBAL ID：200902018886625993   Reference number：88A0480593

Shortest path problems - Taxonomy and annotatino with focused on decomposition algorithms.

最短経路問題 分割算法を中心とした問題の算法の分類・整理
Author (3)：
TAKEMATA KAZUYA

About TAKEMATA KAZUYA

(金沢工大 教育工学セ)

About 金沢工大 教育工学セ

, 
NAKATANI NAYUMI

About NAKATANI NAYUMI

(金沢工業大 大学院)

About 金沢工業大 大学院

, 
MIHARA ICHIRO

About MIHARA ICHIRO

(金沢工大)

About 金沢工大


Material：
金沢工業大学研究紀要 A  (Memoirs of Kanazawa Institute of Technology. A)

About 金沢工業大学研究紀要 A


Issue： 26  Page： 73-106  Publication year： Oct. 1987 
JST Material Number： S0920A  ISSN： 0388-5801  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.
shortest route problem

About shortest route problem

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=88A0480593&from=J-GLOBAL&jstjournalNo=S0920A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Other methods of operations research 
(KA03070E)

About Other methods of operations research

Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
最短経路問題

About 最短経路問題

, 
算法

About 算法

, 
分類

About 分類

, 
整理

About 整理


Return to Previous Page

TOP

BOTTOM