| 研究課題/領域番号 |
16H02785
|
|---|
| 研究機関 | 京都大学 |
|---|
研究代表者 |
Avis David 京都大学, 情報学研究科, 研究員 (90584110)
|
|---|
| 研究分担者 |
ジョーダン チャールズハロルド 北海道大学, 情報科学研究科, 助教 (60647577)
|
|---|
| 研究期間 (年度) |
2016-04-01 – 2021-03-31
|
| キーワード | 幾何計算 / 大規模並列化 / 数理計画法への応用 |
|---|
| 研究実績の概要 |
Our research plan involves 5 overlapping projects each involving myself and a subgroup of the team.I am involved in all projects.
1(Devroye)We developed a theoretic basis for our experimental results by studying the overhead of budgeting on random Galton-Watson trees proving a strong convergence result. Devroye visited Kyoto May 9-19 and we completed a paper in March 2017 which we published on the arXiv and submitted to a journal.
2(Jordan) We developed a mts,a generic framework for parallelizing tree search methods and applied this framework to reverse search algorithms for topological sort and spanning tree enumeration and, using data sharing, for SAT solvers. We completed a new paper on mts and revised our mplrs paper.
3.(Tiwary) We found a compact extended formulation for testing 2-satisfiability.Tiwary visited Kyoto Feb 1-14 and we completed a paper and submitted it to the arXiv and a journal.
4(Cook,Tiwary) Cook visited from June 5-19 to discuss parallel branch and bound.We did preliminary experiments using mts to parallelize his QSopt integer programming software.
5(all members)Laboratory for Parallel Geometric Computation (LPGC). Software for multicore tree search (mts) was released under public license this fiscal year.
|
| 現在までの達成度 (区分) |
現在までの達成度 (区分)
2: おおむね順調に進展している
理由
We are proceeding along the plans we described in our proposal and have made very good progress on all 5 projects.
|
| 今後の研究の推進方策 |
We will continue all 5 projects along the lines outlined in the grant application. Specific goals for the upcoming fiscal year are as follows:
1(Devroye)We will try to extend our theoretic basis for our experimental results by studying new random tree models. We will also try to model branch and bound as applied to Galton-Watson trees. Devroye will visit from May 22-June 3.
2(Jordan) We will apply mts to parallelize applications such as the enumeration of triangulations and regular triangulations, branch and bound and QBF formulae.
3.(Tiwary) We will try to find new compact extended formulations for problems in P with high extension complexity with particular attention to the perfect matching problem.
4(Cook,Tiwary) We will try to extend mts to solve integer programs efficiently in parallel by adding cutting planes to QSopt. Cook will visit May 22-June 3.
5(all members)Laboratory for Parallel Geometric Computation (LPGC). A new version of software for multicore tree search (mts) will be released under public license this fiscal year.
|
