BiqBin at IPCO
24. 5. 2019, Elisabeth Gaar
Nicolo Gusmeroli and Elisabeth Gaar presented their work at IPCO.
Two researchers of the BiqBin project presented their work at IPCO (Integer Programming and Combinatorial Optimization) 2019 in Ann Arbor, Michigan, USA.
Nicolo Gusmeroli presented in the poster session. The poster rose a lot of interest and Nicolo answered a lot of questions.
The paper "A Bundle Approach for SDPs with Exact Subgraph Constraints" by Elisabeth Gaar and Franz Rendl was accepted at the highly competitive conference IPCO and therefore Elisabeth Gaar gave a talk. As a next step the results of the paper will be included into BiqBin.
BiqBin in Iowa
18. 5. 2019, Nicolo Gusmeroli
Nicolo Gusmeroli visited Prof. Sam Burer (University of Iowa)
Nicolo Gusmeroli stayed three weeks in Iowa City for research. He was a visitor of Prof. Sam Burer and together they worked on the relaxations for the exact penalty method over discrete sets.
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.
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.
Gusmeroli - An Exact Penalty Method Over Discrete Sets
The presentation by Nicolo Gusmeroli.