Renata Sotirov

According to our database, Renata Sotirov authored at least 36 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Integrality in Semidefinite Programming for Discrete Optimization.

Frank de Meijer, Renata Sotirov

SIAM J. Optim., March, 2024

2023

Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs.

Hao Hu, Renata Sotirov, Henry Wolkowicz

Math. Program., 2023

Partitioning through projections: Strong SDP bounds for large graph partition problems.

Frank de Meijer, Renata Sotirov, Angelika Wiegele, Shudian Zhao

Comput. Oper. Res., 2023

2022

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs.

Lennart Sinjorgo, Renata Sotirov

SIAM J. Optim., 2022

The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems.

Olga Kuryatnikova, Renata Sotirov, Juan C. Vera

INFORMS J. Comput., 2022

Preface: Quadratic combinatorial optimization problems.

Abraham P. Punnen, Renata Sotirov

Discret. Optim., 2022

2021

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning.

Frank de Meijer, Renata Sotirov

INFORMS J. Comput., 2021

Lower bounds for the bandwidth problem.

Franz Rendl, Renata Sotirov, Christian Truden

Comput. Oper. Res., 2021

The linearization problem of a binary quadratic problem and its applications.

Hao Hu, Renata Sotirov

Ann. Oper. Res., 2021

2020

On solving the densest k-subgraph problem on large graphs.

Renata Sotirov

Optim. Methods Softw., 2020

The quadratic cycle cover problem: special cases and efficient bounds.

Frank de Meijer, Renata Sotirov

J. Comb. Optim., 2020

On Solving the Quadratic Shortest Path Problem.

Hao Hu, Renata Sotirov

INFORMS J. Comput., 2020

2018

Special cases of the quadratic shortest path problem.

Hao Hu, Renata Sotirov

J. Comb. Optim., 2018

The min-cut and vertex separator problem.

Franz Rendl, Renata Sotirov

Comput. Optim. Appl., 2018

Graph bisection revisited.

Renata Sotirov

Ann. Oper. Res., 2018

2015

Semidefinite programming and eigenvalue bounds for the graph partition problem.

Edwin R. van Dam, Renata Sotirov

Math. Program., 2015

Supply chain network downsizing with product line pruning using a new demand substitution.

Jalal Ashayeri, Ning Ma, Renata Sotirov

J. Oper. Res. Soc., 2015

A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives.

Etienne de Klerk, Renata Sotirov, Uwe Truetsch

INFORMS J. Comput., 2015

On Bounding the Bandwidth of Graphs with Symmetry.

Edwin R. van Dam, Renata Sotirov

INFORMS J. Comput., 2015

2014

An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem.

Renata Sotirov

INFORMS J. Comput., 2014

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems.

Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov, Uwe Truetsch

Eur. J. Oper. Res., 2014

2013

On semidefinite programming bounds for graph bandwidth.

Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov

Optim. Methods Softw., 2013

2012

Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry.

Etienne de Klerk, Renata Sotirov

Math. Program., 2012

On semidefinite programming relaxations of maximum $$k$$ -section.

Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre

Math. Program., 2012

Clique-based facets for the precedence constrained knapsack problem.

Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov

Math. Program., 2012

A polynomial optimization approach to constant rebalanced portfolio selection.

Yuichi Takano, Renata Sotirov

Comput. Optim. Appl., 2012

2011

An aggregated optimization model for multi-head SMD placements.

Jalal Ashayeri, Ning Ma, Renata Sotirov

Comput. Ind. Eng., 2011

2010

Matrix-lifting semi-definite programming for detection in multiple antenna systems.

Amin Mobasher, Renata Sotirov, Amir K. Khandani

IEEE Trans. Signal Process., 2010

Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem.

Etienne de Klerk, Renata Sotirov

Math. Program., 2010

2009

Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem.

Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov

SIAM J. Optim., 2009

A new library of structured semidefinite programming instances.

Etienne de Klerk, Renata Sotirov

Optim. Methods Softw., 2009

On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs.

Etienne de Klerk, Michael W. Newman, Dmitrii V. Pasechnik, Renata Sotirov

Eur. J. Comb., 2009

2008

On Semidefinite Programming Relaxations of the Traveling Salesman Problem.

Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov

SIAM J. Optim., 2008

2007

A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming.

Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani

IEEE Trans. Inf. Theory, 2007

Bounds for the quadratic assignment problem using the bundle method.

Franz Rendl, Renata Sotirov

Math. Program., 2007

2006

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition.

Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov

Math. Program., 2006