VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
Celotno besedilo
  • BiqBin: moving boundaries for NP-hard problems by HPC
    Hrga, Timotej ...
    In this paper we present a parallel Branch and Bound (B&B) algorithm to solve the Stable Set Problem, which is a well-known combinatorial optimization problem. The algorithm is based on tight ... semidefinite programming bounds. Numerical results, based on using up to 192 CPU cores, show that this algorithm scales well. This algorithm is available as a part of the online BiqBin solver, which enables online submissions of problem instances. After submission, it automatically generates computational jobs and runs them using the high-performance computer available at University of Ljubljana. BiqBin demonstrates how to bring HPC closer to specific user community - in our case the mathematical optimization community.
    Vrsta gradiva - prispevek na konferenci
    Leto - 2021
    Jezik - angleški
    COBISS.SI-ID - 27695875