Development of Efficient and Accurate Approximation Algorithms for Constrained Optimization of Discrete Convex Functions
| Project/Area Number |
21740060
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
SHIOURA Akiyoshi 東北大学, 大学院・情報科学研究科, 准教授 (10296882)
|
|---|
| Project Period (FY) |
2009 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2009: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Keywords | 離散最適化 / 組合せ最適化 / 数理計画 / 離散凸関数 / 近似アルゴリズム / アルゴリズム / マトロイド / 劣モジュラ関数 / マトロスド |
|---|
| Research Abstract |
The aim of this research is to develop algorithms with theoretical guarantee for both of computational time and quality of solutions by using the theory of discrete convex analysis. During the three years of the research period, I have obtained various new results. In particular, I developed a polynomial-time approximation scheme for the maximization of an M-concave function under multiple knapsack constraints. In addition, I revealed the structure of a general solution set called a neighbor system, and showed that the minimization of a separable-convex function over a neighbor system can be solved in polynomial time.
|
Report
(4 results)
Research Products
(22 results)
