42 citations · 144 across the 30 of their papers we have counts for
31 papers
Improved semidefinite programming bounds for the maximum -colorable subgraph problem
Mathijs Barkel, Renata Sotirov
We study the maximum -colorable subgraph (MCS) problem, which consists in finding a largest -colorable induced subgraph in a given graph. We consider a Semidefinite Progra…
Beyond binarity: Semidefinite programming for ternary quadratic problems
Frank de Meijer, Veronica Piccialli, Renata Sotirov +1
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in . While semidefinite program…
SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
Lennart Sinjorgo, Renata Sotirov, Juan C. Vera
We consider the Lasserre hierarchy for computing bounds on the stability number of graphs. The semidefinite programs (SDPs) arising from this hierarchy involve large matrix variabl…
Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
Sander Gribling, Lennart Sinjorgo, Renata Sotirov
We study polynomial-time approximation algorithms for the Quantum Max-Cut (QMC) problem. Given an edge-weighted graph on n vertices, the QMC problem is to determine the largest…
Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
Frank de Meijer, Renata Sotirov
This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian…
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…