Zobrazeno 1 - 6
of 6
pro vyhledávání: '"GUSMEROLI, NICOLÒ"'
Autor:
Gusmeroli, Nicolo, Bettinelli, Andrea
The shift design and the personnel scheduling problem is known to be a difficult problem. It is a real-world problem which has lots of applications in the organization of companies. Solutions are usually found by dividing the problem in two steps: fi
Externí odkaz:
http://arxiv.org/abs/2403.17850
Autor:
Gusmeroli, Nicolò, Hrga, Timotej, Lužar, Borut, Povh, Janez, Siebenhofer, Melanie, Wiegele, Angelika
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 pro
Externí odkaz:
http://arxiv.org/abs/2009.06240
Autor:
Gusmeroli, Nicolo, Wiegele, Angelika
We address the problem of minimizing a quadratic function subject to linear constraints over binary variables. We introduce the exact solution method called EXPEDIS where the constrained problem is transformed into a max-cut instance, and then thewho
Externí odkaz:
http://arxiv.org/abs/1912.09739
Autor:
Gusmeroli, Nicolò, Wiegele, Angelika
Publikováno v:
In Discrete Optimization May 2022 44 Part 2
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gusmeroli, Nicolò
Binary quadratic programming is an important modelling tool for combinatorial optimization problems. This topic has been widely studied in the last thirty years due to the huge number of real world applications. For some combinatorial optimization pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4193::8f3f47c39960be8913a9e8534b026e78
https://resolver.obvsg.at/urn:nbn:at:at-ubk:1-41141
https://resolver.obvsg.at/urn:nbn:at:at-ubk:1-41141