42 citations · 160 across the 17 of their papers we have counts for
17 papers
Strong SDP based bounds on the cutwidth of a graph
Elisabeth Gaar, Diane Puges, Angelika Wiegele
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex with respect to this ordering is the number of edges from any vertex before (including ) to…
Partitioning through projections: strong SDP bounds for large graph partition problems
Frank de Meijer, Renata Sotirov, Angelika Wiegele +1
The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed number of disjoint subsets of given sizes such that the sum of weights of edges joining…
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…
Tight SDP relaxations for cardinality-constrained problems
Angelika Wiegele, Shudian Zhao
We model the cardinality-constrained portfolio problem using semidefinite matrices and investigate a relaxation using semidefinite programming. Experimental results show that this…
SDP-based bounds for graph partition via extended ADMM
Angelika Wiegele, Shudian Zhao
We study two NP-complete graph partition problems, -equipartition problems and graph partition problems with knapsack constraints (GPKC). We introduce tight SDP relaxations with…
SOS-SDP: an Exact Solver for Minimum Sum-of-Squares Clustering
Veronica Piccialli, Antonio M. Sudoso, Angelika Wiegele
The minimum sum-of-squares clustering problem (MSSC) consists of partitioning observations into clusters in order to minimize the sum of squared distances from the points t…
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
Nicolò Gusmeroli, Timotej Hrga, Borut Lužar +3
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…
Towards a Computational Proof of Vizing's Conjecture using Semidefinite Programming and Sums-of-Squares
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formu…
Improving ADMMs for Solving Doubly Nonnegative Programs through Dual Factorization
Martina Cerulli, Marianna De Santis, Elisabeth Gaar +1
Alternating direction methods of multipliers (ADMMs) are popular approaches to handle large scale semidefinite programs that gained attention during the past decade. In this paper,…
EXPEDIS: An Exact Penalty Method over Discrete Sets
Nicolo Gusmeroli, Angelika Wiegele
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 const…
SDP-based branch-and-bound for non-convex quadratic integer optimization
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
Semidefinite programming (SDP) relaxations have been intensively used for solving discrete quadratic optimization problems, in particular in the binary case. For the general non-co…
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…
Using a Factored Dual in Augmented Lagrangian Methods for Semidefinite Programming
Marianna De Santis, Franz Rendl, Angelika Wiegele
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint…
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are char…
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
Alain Billionnet, Sourour Elloumi, Amélie Lambert +1
We present algorithm MIQCR-CB that is an advancement of method MIQCR~(Billionnet, Elloumi and Lambert, 2012). MIQCR is a method for solving mixed-integer quadratic programs and wor…
Exact Solution Methods for the -item Quadratic Knapsack Problem
Lucas Létocart, Angelika Wiegele
The purpose of this paper is to solve the 0-1 -item quadratic knapsack problem , a problem of maximizing a quadratic function subject to two linear constraints. We propo…
Another pedagogy for mixed-integer Gomory
Jon Lee, Angelika Wiegele
We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a "dual form" mixed-integer optimization problem and applied on the standa…