<departmental bulletin paper>
Negative-Equivalent Method of Solving Associative Optimal Path Problems for a Network that May Contain Cycles

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
JaLC DOI
Table of Contents 1. 序
2. 結合型最適経路問題
3. 基本路が最適経路であるための必要十分条件
4. 負同値性定理(negative-equivalency theorem)
5. 逐次列の構成(フォード法)
6. 負同値法(negative-equivalentmethod)

Hide fulltext details.

pdf 6601_p007 pdf 665 KB 218  

Details

PISSN
NCID
Record ID
Peer-Reviewed
Created Date 2021.02.25
Modified Date 2022.02.18

People who viewed this item also viewed