2013 Fiscal Year Final Research Report
Theory and algorithm of multiflow, facility location, and network design
| Project/Area Number |
23740068
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
HIRAI Hiroshi 東京大学, 情報理工学系研究科, 講師 (20378962)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Keywords | 施設配置問題 / 多品種流 / ネットワークデザイン / メトリック |
|---|
| Research Abstract |
The main result of this research project is to complete the classification of graphs G for which multifacility location problem (minimum 0-extension problem) on G is polynomial time solvable. In the proof, we introduced discrete convex functions on a class of graphs, and opened up new research direction "discrete convexity for multiflow and facility locations." This is an important step toward a unified theory for multiflow, facility location, and network design, which was the goal of this research project.
|
