Borut Lužar

Borut Lužar

Auto-generated profile, based on publicly available information

Borut Lužar

Fac Informat Studies Novo Mesto, Novo Mesto, Slovenia

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 April 2014 in PLOS ONE
Verified
Journal Article
Open access
PDF file
BLBorut Lužar
Borut Lužar
ZLZoran Levnajić
Zoran Levnajić
JPJanez Povh
Janez Povh
Matjaz PercMatjaz Perc
Matjaz Perc
Interaction among the scientific disciplines is of vital importance in modern science. Focusing on the case of Slovenia, we study the dynamics of interdisciplinary sciences from to . Our approach relies on quantifying the interdisciplinarity of research communities detected in the coauthorship network of Slovenian scientists over time. Examining the evolution of the community structure, we find that the frequency of interdisciplinary research is only proportional with the overall growth of the network. Although marginal improvements in favor of interdisciplinarity are inferable during the 70s and 80s, the overall trends during the past 20 years are constant and indicative of stalemate. We conclude that the flow of knowledge between different fields of research in Slovenia is in need of further stimulation.

3 October 2022 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
IFIgor Fabrici
Igor Fabrici
BLBorut Lužar
Borut Lužar
SRSimona Rindošová
Simona Rindošová
RSRoman Soták
Roman Soták

1 September 2009 in Discrete Mathematics
Verified
Journal Article
Closed access
BLBorut Lužar
Borut Lužar
RŠRiste Škrekovski
Riste Škrekovski
MTMartin Tancer
Martin Tancer

18 February 2015 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
ĽBĽudmila Bezegová
Ľudmila Bezegová
BLBorut Lužar
Borut Lužar
MMMartina Mockovčiaková
Martina Mockovčiaková
RSRoman Soták
Roman Soták
RŠRiste Škrekovski
Riste Škrekovski

30 June 2022 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
NGNicolò Gusmeroli
Nicolò Gusmeroli
THTimotej Hrga
Timotej Hrga
BLBorut Lužar
Borut Lužar
Janez PovhJanez Povh
Janez Povh
MSMelanie Siebenhofer
Melanie Siebenhofer
AWAngelika Wiegele
Angelika Wiegele
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 problem into an instance of Max-Cut, and then to solve the Max-Cut problem by a branch-and-bound algorithm. All the main ingredients are carefully developed using new semidefinite programming relaxations obtained by strengthening the existing relaxations with a set of hypermetric inequalities, applying the bundle method as the bounding routine and using new strategies for exploring the branch-and-bound tree.Furthermore, an efficient C implementation of a sequential and a parallel branch-and-bound algorithm is presented. The latter is based on a load coordinator-worker scheme using MPI for multi-node parallelization and is evaluated on a high-performance computer.The new solver is benchmarked against BiqCrunch, GUROBI, and SCIP on four families of (linearly constrained) binary quadratic problems. Numerical results demonstrate that BiqBin is a highly competitive solver. The serial version outperforms the other three solvers on the majority of the benchmark instances. We also evaluate the parallel solver and show that it has good scaling properties. The general audience can use it as an on-line service available athttp://www.biqbin.eu.

8 June 2018 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
BLBorut Lužar
Borut Lužar
JPJakub Przybyło
Jakub Przybyło
RSRoman Soták
Roman Soták