20 citations · 22 across the 6 of their papers we have counts for
6 papers
Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
Jaka Vodeb, Vid Eržen, Timotej Hrga +1
This paper investigates the performance of quantum, classical, and hybrid solvers on the NP-hard Max-Cut and QUBO problems, examining their solution quality relative to the global…
Connectivity via convexity: Bounds on the edge expansion in graphs
Timotej Hrga, Melanie Siebenhofer, Angelika Wiegele
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by H…
Ground truth clustering is not the optimum clustering
Lucia Absalom Bautista, Timotej Hrga, Janez Povh +1
The clustering of data is one of the most important and challenging topics in data science. The minimum sum-of-squares clustering (MSSC) problem asks to cluster the data points int…
Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
Rok Hribar, Timotej Hrga, Gregor Papa +4
In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simul…
MADAM: A parallel exact solver for Max-Cut based on semidefinite programming and ADMM
Timotej Hrga, Janez Povh
We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound par…
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
Nicolò Gusmeroli, Timotej Hrga, Borut Lužar +3
We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our approach is based on an exact penalty method to first efficiently transform the original…