News


BiqBin at BAMC2019

26. 4. 2019, Timotej Hrga, Janez Povh

Prof. Janez Povh gave a talk entitled Parallel Branch and Bound Algorithm for the Stable Set problem at British Applied Mathematics Colloquium 2019 (BAMC 2019). This was one of the very few talks relating HPC and applied matematics.

Prof. Janez Povh gave a talk entitled Parallel Branch and Bound Algorithm for the Stable Set problem at British Applied Mathematics Colloquium 2019 (BAMC 2019).
This was one of the very few talks relating HPC and applied matematics.

janez Povh at BAMC2019
Photo: Janez Povh

Presentation of the BiqBin Project

3. 4. 2019, Nicolo Gusmeroli

Presentation of the BiqBin project at the 3rd AIROYoung Workshop of Rome.

On March 28, the PhD student from Alpen-Adria-Universität, Nicolo Gusmeroli, gave a talk at the 3rd AIROYoung Workshop in which he presented the exact penalty method over discrete sets used in the max-cut algorithm. He showed also the latest computational results.

See also:

The Participants
Photo: https://twitter.com/AIROyoung

BiqBin workshop at Alpen Adria University Klagenfurt

21. 2. 2019, Janez Povh

BiqBin team had a regular workshop, devoted to monitoring the progress in the last few months and preparing the plans for the following 3 months.

At the workshop, we evaluated:
- the new version of the BiqBin web server,
- the structure of the benchmark library,
- the new parallel solver for the stable set problem;
- pilot code for the exact penalty approach to solve binary quadratic problems with linear constraints and it comparison with CPLEX solver;

We also made a dissemination plan for 2019.
Summing up, the project is progressing well and several excellent publications will be finished soon.

The BiqBin team in front of the AAU
Photo: Elisabeth Gaar

Presentation of the BiqBin project at the UG Workshop 2019

16. 1. 2019, Timotej Hrga , Source: UG Workshop 2019

Presentation of the latest developments of the BiqBin project at the UG Workshop 2019 in Berlin.

At the First International UG Workshop 2019 on parallel algorithms in tree search and mathematical optimization we presented our BiqBin project.

The presentation was given by Timotej Hrga, a PhD student working on this project. He presented the latest developments in the design of the parallel algorithm and showed numerical results for the stable set problem.

See also:

The Participants
Photo: https://ug.zib.de/workshop2019/