2023 Fiscal Year Final Research Report
Algorithms for discrete optimization problems on network structures and their applications
| Project/Area Number |
16K00001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Hokkaido University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2016-04-01 – 2024-03-31
|
| Keywords | 組合せ最適化 / アルゴリズム / ネットワーク設計 / グラフ理論 / 離散最適化 |
|---|
| Outline of Final Research Achievements |
In modern society, we have many network structures such as communication networks, traffic networks, power grids, and VLSI. In this research, we focus on problems which appear on the design and control of such networks. By formalizing them as discrete optimization problems on graphs, we proposed several efficient algorithms for solving them and analyzed their computational complexities. Also, we extended these results, which may contribute to the analysis of other genearal problems.
|
| Free Research Field |
組合せ最適化，アルゴリズム理論
|
| Academic Significance and Societal Importance of the Research Achievements |
現代社会において解決が求められる諸問題の中には, 通信網・交通網などネットワーク的構造を持つものが多くみられる．本研究では，特に，ネットワーク制御・設計に関するいくつかの問題に対して，効率的なアルゴリズムの開発や問題の困難さの解析を行った．これらの成果は基礎研究であり，直ちに実用化されるものではないが，近年，地震・台風等による自然災害が頻発する中，より安定的なネットワーク制御・設計のために寄与しうる研究と位置づけられる．
|
