2015 Fiscal Year Annual Research Report
| Project Area | A multifaceted approach toward understanding the limitations of computation |
|---|
| Project/Area Number |
24106006
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
Avis David 京都大学, 情報学研究科, 教授 (90584110)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
天野 一幸 群馬大学, その他部局等, 教授 (30282031)
|
|---|
| Project Period (FY) |
2012-06-28 – 2017-03-31
|
| Keywords | 幾何計算 / 最適化 / 数理計画法への応用 |
|---|
| Outline of Annual Research Achievements |
International Collaboration: We received visits from David Bremner (April 1 - May 3) and Hans Tiwary (June 12 -27) at Kyoto University. Bremner and Avis further developed their compiler for computing linear programs from pseudocode. A working prototype was built and applied to the matching problem. Tiwary and Avis completed work on generalizing their extension complexity results for the traveling salesman problem. The paper was revised and accepted for publication. Both visitors gave invited seminars.
Four journal papers were published by Avis during the last year and two new papers were written with Charles Jordan (Hokkaido U.) and uploaded to the arXiv. The first paper presented numerical results for the mplrs parallel vertex enumeration software code written with Jordan. This code was released in July 2015. The second paper was a technical discussion of the new techniques of parallel tree search that are contained in mplrs.This paper has been submitted to an international journ
al for publication. They made further improvements to mplrs during the year resulting in a new release in November 2015. Additional code was written for finding Nash equilibrium. This code was developed with Terje Lensberg (NHH,Norway).
|
| Current Status of Research Progress |
Current Status of Research Progress
2: Research has progressed on the whole more than it was originally planned.
Reason
研究実績の概要で述べた研究成果は，プロジェクトのゴールへ向けて重要な進展となっている．
|
| Strategy for Future Research Activity |
This year's visitors are expected to include David Bremner, William Cook, Luc Devroye and Hans Tiwary. Bremner and Avis will plan to their compiler for making linear programs from pseudocode. Cook and Avis will be using the compiler to try to find relatively compact formulations for the traveling salesman problem. Devroye and Avis will try to analyze the budgeted tree search paradigm developed by Jordan and Avis during the last fiscal year. Tiwary and Avis will continue their study of extension complexity, including the generalizations recently proposed. Skip Jordan and Avis will continue to develop a standard framework, mts, for parallelizing a large class of tree search algorithms. They will do empirical experiments on a cluster of computers located at the Graduate School of Informatics at Kyoto University. They plan to submit a conference paper and journal paper based around this work in the current fiscal year.
|
| Remarks |
Release of lrslib-060 in July 2015 and lrslib-061 in November 2015. These contained the new parallel implementation, mplrs, of the vertex
enumeration software called lrs.
|
