Paper published - Solving SDP relaxations of Max‑Cut problem with large number of hypermetric inequalities by L‑BFGS‑B

30. 7. 2023, Janez Povh

Prof. Janez Povh and dr. Timotej Hrga published paper Solving SDP relaxations of Max‑Cut problem with large number of hypermetric inequalities by L‑BFGS‑B in Optimization Letters. The paper contains approach how to tighten SDP relaxation for Max Cut with large number hypermetric inequaltioes.

Prof. Janez Povh and dr. Timotej Hrga published paper
Solving SDP relaxations of Max‑Cut problem with large
number of hypermetric inequalities by L‑BFGS‑B
in Optimization Letters.
The paper contains approach how to tighten SDP relaxation for Max Cut with large number hypermetric inequaltioes.

See:
Hrga, T., & Povh, J. (2023). Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B. Optimization Letters, 17(5), 1201-1213.

Timotej Hrga defended his PhD

30. 6. 2022, Janez Povh

On June 30, 2022, Timotej Hrga successfully defended his PhD with title: APPLICATION OF SEMIDEFINITE PROGRAMMING AND HIGH-PERFORMANCE COMPUTING IN DISCRETE OPTIMIZATION.

On June 30, 2022, Timotej Hrga successfully defended his PhD with title:
APPLICATION OF SEMIDEFINITE
PROGRAMMING AND
HIGH-PERFORMANCE COMPUTING IN
DISCRETE OPTIMIZATION.
Dissertation was closely related to the development of the BiqBin solver.
His advisor was prof. Janez Povh, co-advisor: prof. Angelika Wiegele.

MADAM paper published

8. 5. 2022, Janez Povh , Source: https://link.springer.com/article/10.1007/s10589-021-00310-6

Timotej Hrga and Janez Povh published a paper MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM, which contains some of the results obtained within the BiqBin project

Timotej Hrga and Janez Povh published a paper MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM, which contains some of the results obtained within the BiqBin project.
See https://link.springer.com/article/10.1007/s10589-021-00310-6.

BiqBin paper accepted for publication

15. 2. 2022, Janez Povh

The paper BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints was accepted for publication in ACM Transactions on Mathematical Software. See https://arxiv.org/abs/2009.06240.

The paper BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
was accepted for publication in ACM Transactions on Mathematical Software. See https://arxiv.org/abs/2009.06240.