7 citations · 9 across the 2 of their papers we have counts for
2 papers
math.OC2024★ 2 cited
Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem
Frank de Meijer, Melanie Siebenhofer, Renata Sotirov +1
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 present a formulation…
math.OC2022★ 7 cited
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…