Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Janez Radescek"'
Autor:
Janez Radescek, Matjaz Depolli
Publikováno v:
MIPRO
We present a C++ template for writing branch and bound algorithms that are efficient yet easy to read and understand. The approach separates the logic of an abstract methodology for dealing with large search spaces efficiently from the concrete imple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4787dea29f70e87d16a717ede84346c
https://doi.org/10.23919/mipro52101.2021.9597018
https://doi.org/10.23919/mipro52101.2021.9597018
Autor:
Matjaž Depolli, Janez Radescek
Publikováno v:
GECCO Companion
We propose a parallel solver for the unicost set covering problem based on branch and bound approach. The main contributions of this algorithm lay in its fast parallel execution and the ability to work in approximate mode. We demonstrate the proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d5cc31c7a133a38e0392712d6338526
https://doi.org/10.1145/3449726.3463298
https://doi.org/10.1145/3449726.3463298