Export Mendeley
＜Doctoral Thesis＞
Optimal Path Problems with Path Lengths Defined by Associative Binary Operations
| Creator | |
|---|---|
| Language | |
| Academic Year Conferred | |
| Conferring University | |
| Degree | |
| Degree Type | |
| Publication Type | |
| Access Rights | |
| JaLC DOI | |
| Related URI | |
| Table of Contents | Chapter1 Introduction Chapter2 Dynamic programming formulation for associative optimal path problems Chapter3 Bynamic programming formulation for associative optimal path problems Chapter4 On a negative-equivalency theorem in associative optimal path problems Chapter5 An invariant imbedding approach to associative shortest path problems |
Hide fulltext details.
| File | FileType | Size | Views | Description |
|---|---|---|---|---|
maruyama
|
11.6 MB | 342 |
Details
| Record ID | |
|---|---|
| Peer-Reviewed | |
| Report Number | |
| Number of Diploma | |
| Granted Date | |
| Faculty | |
| Location | |
| Location | |
| Call Number | |
| Notes | |
| Created Date | 2013.06.27 |
| Modified Date | 2023.12.08 |