R. Sotirov

activity

20052026

most citedOn semidefinite programming relaxations of the traveling salesman problem

42 citations · 144 across the 30 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.OC2026

Improved semidefinite programming bounds for the maximum $k$ -colorable subgraph problem

Mathijs Barkel, Renata Sotirov

We study the maximum $k$ -colorable subgraph (M $k$ CS) problem, which consists in finding a largest $k$ -colorable induced subgraph in a given graph. We consider a Semidefinite Progra…

math.OC2026

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 ${0, \pm 1}$ . While semidefinite program…

Improved semidefinite programming bounds for the maximum k-colorable subgraph problem

Beyond binarity: Semidefinite programming for ternary quadratic problems

Improved semidefinite programming bounds for the maximum $k$ -colorable subgraph problem