| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2011: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2008: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Research Abstract |
Network design problem is a combinatorial optimization problem the goal of which is to construct efficient and stable networks or to control networks effectively. In this research, we considered general models that capture a variety of tasks which are important in applications, and investigated them to develop algorithms. In particular, we have obtained new results for problems such as survivable network design problems with connectivity and degree constraints, submodular partition problem, graph orientation problem with set-connectivity demands, and source location problem.
|
