42 citations · 160 across the 17 of their papers we have counts for
4 papers · 1 filter
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…