| Budget Amount *help |
¥17,810,000 (Direct Cost: ¥13,700,000、Indirect Cost: ¥4,110,000)
Fiscal Year 2019: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2018: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2017: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2016: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2015: ¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
|
|---|
| Outline of Final Research Achievements |
With the rapid development of information technology, various types of information have been stored and become available; however, to utilize them to improve the efficiency of operation or production, or to make decisions based on them, problem-solving for large-scale data has become indispensable. Combinatorial optimization problems often appear as important problems to be solved in such situations. In this study, we devised practical optimization solvers for some of the typical combinatorial optimization problems that appear in such problem-solving situations.
|
