9 citations · 50 across the 22 of their papers we have counts for
5 papers · 1 filter
Sum-of-Squares Certificates for Vizing's Conjecture via Determining Gröbner Bases
Elisabeth Gaar, Melanie Siebenhofer
The famous open Vizing conjecture claims that the domination number of the Cartesian product graph of two graphs and is at least the product of the domination numbers of $G…
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We de…
A scaleable projection-based branch-and-cut algorithm for the -center problem
Elisabeth Gaar, Markus Sinnl
The -center problem (pCP) is a fundamental problem in location science, where we are given customer demand points and possible facility locations, and we want to choose of t…
An SDP-Based Approach for Computing the Stability Number of a Graph
Elisabeth Gaar, Melanie Siebenhofer, Angelika Wiegele
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 p…
Experiments with graph convolutional networks for solving the vertex -center problem
Elisabeth Gaar, Markus Sinnl
In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization pr…