• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2016 Fiscal Year Annual Research Report

Large scale parallelization for geometric computation and mathematical optimization

Research Project

Project/Area Number 16H02785
Research InstitutionKyoto University

Principal Investigator

Avis David  京都大学, 情報学研究科, 研究員 (90584110)

Co-Investigator(Kenkyū-buntansha) ジョーダン チャールズハロルド  北海道大学, 情報科学研究科, 助教 (60647577)
Project Period (FY) 2016-04-01 – 2021-03-31
Keywords幾何計算 / 大規模並列化 / 数理計画法への応用
Outline of Annual Research Achievements

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.

Current Status of Research Progress
Current Status of Research Progress

2: Research has progressed on the whole more than it was originally planned.

Reason

We are proceeding along the plans we described in our proposal and have made very good progress on all 5 projects.

Strategy for Future Research Activity

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.

  • Research Products

    (11 results)

All 2017 2016 Other

All Int'l Joint Research (1 results) Journal Article (4 results) (of which Int'l Joint Research: 4 results,  Peer Reviewed: 4 results,  Acknowledgement Compliant: 4 results,  Open Access: 1 results) Presentation (1 results) (of which Int'l Joint Research: 1 results,  Invited: 1 results) Remarks (5 results)

  • [Int'l Joint Research] School of Computer Science/McGill University(Canada)

    • Country Name
      Canada
    • Counterpart Institution
      School of Computer Science/McGill University
  • [Journal Article] On the H-free Extension Complexity of the TSP2017

    • Author(s)
      D. Avis and H. Tiwary
    • Journal Title

      Optimization Letters

      Volume: 11 Pages: 445-455

    • DOI

      10.1007/s11590-016-1029-1

    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] An Exponential Lower Bound for Cunningham's Rule2017

    • Author(s)
      D. Avis and O. Friedmann
    • Journal Title

      Mathematical Programming

      Volume: 161 Pages: 271-305

    • DOI

      10.1007/s10107-016-1008-4

    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] On the Directed Cut Cone and Polytope2016

    • Author(s)
      D. Avis and C. Meagher
    • Journal Title

      J. Combinatorial Optimization

      Volume: 31 Pages: 1685-17-8

    • DOI

      10.1007/s10878-015-9863-0

    • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
  • [Journal Article] The Kahr-Moore-Wang Class Contains Untestable Properties2016

    • Author(s)
      Charles Jordan and Thomas Zeugmann
    • Journal Title

      Baltic Journal of Modern Computing

      Volume: 4 Pages: 736-752

    • DOI

      10.22364/bjmc.2016.4.4.11

    • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
  • [Presentation] Parallel vertex and facet enumeration with mplrs2017

    • Author(s)
      Charles Jordan
    • Organizer
      Algebraic Statistics and Symbolic Computation
    • Place of Presentation
      RIMS, Kyoto University
    • Year and Date
      2017-07-25 – 2017-07-29
    • Int'l Joint Research / Invited
  • [Remarks] An analysis of budgeted search on G-W trees

    • URL

      https://arxiv.org/abs/1703.10731

  • [Remarks] A Parallel Framework for Reverse Search Using mts

    • URL

      https://arxiv.org/abs/1610.07735

  • [Remarks] Compact Linear Programs for 2SAT

    • URL

      https://arxiv.org/abs/1702.06723

  • [Remarks] Machine Learning with Guarantees ...

    • URL

      https://arxiv.org/abs/1609.02664

  • [Remarks] Tutorial on Parallel Reverse Search using mts

    • URL

      http://cgm.cs.mcgill.ca/~avis/doc/tutorial.html

URL: 

Published: 2018-01-16  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi