博士論文
ImageImage

Optimal path problems with path lengths defined by associative binary operations

Icons representing 博士論文
The cover of this title could differ from library to library. Link to Help Page

Optimal path problems with path lengths defined by associative binary operations

Call No. (NDL)
UT51-2000-E862
Bibliographic ID of National Diet Library
000000352155
Persistent ID (NDL)
info:ndljp/pid/3166963
Material type
博士論文
Author
丸山幸宏 [著]
Publisher
-
Publication date
-
Material Format
Paper・Digital
Capacity, size, etc.
-
Name of awarding university/degree
九州大学,博士 (数理学)
View All

Notes on use

Note (General):

博士論文

Table of Contents

  • Contents

    p1

  • Chapter1 Introduction

    p1

  • Chapter2 Dynamic programming formulation for associative optimal path problems

    p9

  • 1 Introduction

    p9

  • 2 Existence and uniqueness

    p11

Read in Disability Resources

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Paper Digital

Material Type
博士論文
Author/Editor
丸山幸宏 [著]
Author Heading
丸山, 幸宏 マルヤマ, ユキヒロ
Alternative Title
結合法則をみたす2項演算で経路の長さが定義された最適経路問題 ケツゴウ ホウソク オ ミタス 2コウ エンザン デ ケイロ ノ ナガサ ガ テイギサレタ サイテキ ケイロ モンダイ
Degree grantor/type
九州大学
Date Granted
平成12年3月13日
Date Granted (W3CDTF)
2000
Dissertation Number
乙第7032号
Degree Type
博士 (数理学)