Zobrazeno 1 - 10
of 20
pro vyhledávání: '"SIEBENHOFER, MELANIE"'
In the quadratic minimum spanning tree problem (QMSTP) one wants to find the minimizer of a quadratic function over all possible spanning trees of a graph. We give two formulations of the QMSTP as mixed-integer semidefinite programs exploiting the al
Externí odkaz:
http://arxiv.org/abs/2410.04997
Convexification techniques have gained increasing interest over the past decades. In this work, we apply a recently developed convexification technique for fractional programs by He, Liu and Tawarmalani (2024) to the problem of determining the edge e
Externí odkaz:
http://arxiv.org/abs/2410.02526
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant for any g
Externí odkaz:
http://arxiv.org/abs/2403.04657
Autor:
Gaar, Elisabeth, Siebenhofer, Melanie
The famous open Vizing conjecture claims that the domination number of the Cartesian product graph of two graphs $G$ and $H$ is at least the product of the domination numbers of $G$ and $H$. Recently Gaar, Krenn, Margulies and Wiegele used the graph
Externí odkaz:
http://arxiv.org/abs/2112.04007
Finding the stability number of a graph, i.e., the maximum number of vertices of which no two are adjacent, is a well known NP-hard combinatorial optimization problem. Since this problem has several applications in real life, there is need to find ef
Externí odkaz:
http://arxiv.org/abs/2108.05716
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
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:
Gaar, Elisabeth1 (AUTHOR), Siebenhofer, Melanie2 (AUTHOR), Wiegele, Angelika2 (AUTHOR) angelika.wiegele@aau.at
Publikováno v:
Mathematical Methods of Operations Research. Feb2022, Vol. 95 Issue 1, p141-161. 21p.
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:
Siebenhofer, Melanie
Melanie Siebenhofer
Diplomarbeit Alpen-Adria-Universität Klagenfurt 2018
auf Deutsch
Diplomarbeit Alpen-Adria-Universität Klagenfurt 2018
auf Deutsch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4193::0fdc23def043abef0d10fb86967c995d
https://resolver.obvsg.at/urn:nbn:at:at-ubk:1-35833
https://resolver.obvsg.at/urn:nbn:at:at-ubk:1-35833