| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2021: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2020: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
Discrete convex integer programming problem is a discrete optimization problem to find an integral vector minimizing a given discrete convex function under a given constraint. In this research, we consider a new problem called "a robust discrete convex integer programming problem" in which uncertainty arises in problem input. Based on my previous research results, we aimed at developing algorithms for this new problem which has theoretical guarantee in the quality of an obtained solution and computation time. We obtained various interesting results on robust version of several discrete optimization problems.
|
