Continuous Optimization Approach to Discrete Decision Problems
| Project/Area Number |
15H06286
|
|---|
| Research Category |
Grant-in-Aid for Research Activity Start-up
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Foundations of mathematics/Applied mathematics
|
|---|
| Research Institution | Toyohashi University of Technology |
|---|
Principal Investigator |
Kimura Kei 豊橋技術科学大学, 工学(系)研究科(研究院), 助教 (00758716)
|
|---|
| Project Period (FY) |
2015-08-28 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 制約充足問題 / アルゴリズム / 数理計画法 |
|---|
| Outline of Final Research Achievements |
In this research project, we obtained the following results.
(1) We analyzed the applicability of linear program to the constraint satisfaction problem and proposed an algorithm to find a satisfiability preserving assignment. (2) We applied the result (1) to Horn CNFs and obtained a linear time algorithm to find a linear autark assignment. (3) We revealed the computational complexity of optimal matroid partitioning problems under various objective functions. (4) We revealed the computational complexity of three discrete puzzles.
|
Report
(3 results)
Research Products
(6 results)
