Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
Outline of Final Research Achievements |
In this project, we designed efficient algorithms for continuous and discrete optimization problems using their combinatorial structures. For discrete optimization problems, we analyzed combinatorial structures such as the Erdos-Posa property for packing/covering integer programming problems. The analysis is based on structural graph theory. The structures we found are used to develop efficient fixed-parameter algorithms. For continuous optimization problems, we mainly focused on the linear complementarity problems. We discussed the integrality of the linear complementarity problems. We also proposed efficient algorithms for LCP exploiting the sparsity.
|