Combinatorial aspects of some linear programming problems 線形計画問題における組合わせ的性質
Access this Article
Search this Article
Author
Bibliographic Information
- Title
-
Combinatorial aspects of some linear programming problems
- Other Title
-
線形計画問題における組合わせ的性質
- Author
-
松井, 知己, 1962-
- Author(Another name)
-
マツイ, トモミ
- University
-
東京工業大学
- Types of degree
-
理学博士
- Grant ID
-
甲第2391号
- Degree year
-
1992-02-29
Note and Description
博士論文
identifier:oai:t2r2.star.titech.ac.jp:50207556
Table of Contents
- 論文目録 (2コマ目)
- Contents/p1 (5コマ目)
- 1 Introduction/p1 (6コマ目)
- 2 On the Finiteness of the Criss-Cross Method/p7 (12コマ目)
- 2.1 The Criss-Cross Method/p7 (12コマ目)
- 2.2 Proof of the Finiteness/p11 (16コマ目)
- 2.3 Flexibility of the Criss-Cross Method/p15 (20コマ目)
- 3 A Linear Time Algorithm for the Hitchcock Transportation Problem with Fixed Number of Supply Points/p16 (21コマ目)
- 3.1 Introduction/p16 (21コマ目)
- 3.2 Hitchcock Transportation Problem/p18 (23コマ目)
- 3.3 Problem Reduction Procedure/p19 (24コマ目)
- 3.4 A Linear Time Algorithm for λ-Assignment Problems/p21 (26コマ目)
- 3.5 A Linear Time Algorithm for Hitchcock Transportation Problems/p24 (29コマ目)
- 4 Finding All the Optimal Perfect Matchings in Bipartite Graphs/p28 (33コマ目)
- 4.1 Introduction/p28 (33コマ目)
- 4.2 Fundamental Properties/p29 (34コマ目)
- 4.3 Main Framework for the Algorithm/p30 (35コマ目)
- 4.4 Improvement of the Algorithm/p34 (39コマ目)
- 5 Finding All the Optimal Extreme Point Solutions of the Hitchcock Transportation Problem/p37 (42コマ目)
- 5.1 Introduction/p37 (42コマ目)
- 5.2 Fundamental Properties/p39 (44コマ目)
- 5.3 Algorithm for Finding All Elementary Cycles/p41 (46コマ目)
- 5.4 Algorithm for Finding All Vertices of the Hitchcock Transportation Polytope/p45 (50コマ目)
- Bibliograpy/p47 (52コマ目)