Renata Sotirov

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 21

Top Topics

Top Venues

INFORMS J. Comput.

Ann. Oper. Res.

J. Comb. Optim.

Publications

Lennart Sinjorgo, Renata Sotirov
On Solving MAX-SAT Using Sum of Squares. INFORMS J. Comput. 36 (2) (2024)
Frank de Meijer, Renata Sotirov
On Integrality in Semidefinite Programming for Discrete Optimization. SIAM J. Optim. 34 (1) (2024)
Frank de Meijer, Renata Sotirov, Angelika Wiegele, Shudian Zhao
Partitioning through projections: Strong SDP bounds for large graph partition problems. Comput. Oper. Res. 151 (2023)
Hao Hu, Renata Sotirov, Henry Wolkowicz
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. Math. Program. 200 (1) (2023)
Abraham P. Punnen, Renata Sotirov
Preface: Quadratic combinatorial optimization problems. Discret. Optim. 44 (Part) (2022)
Lennart Sinjorgo, Renata Sotirov
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs. SIAM J. Optim. 32 (2) (2022)
Olga Kuryatnikova, Renata Sotirov, Juan C. Vera
-Colorable Subgraph Problem and Related Problems. INFORMS J. Comput. 34 (1) (2022)
Franz Rendl, Renata Sotirov, Christian Truden
Lower bounds for the bandwidth problem. Comput. Oper. Res. 135 (2021)
Frank de Meijer, Renata Sotirov
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning. INFORMS J. Comput. 33 (4) (2021)
Hao Hu, Renata Sotirov
The linearization problem of a binary quadratic problem and its applications. Ann. Oper. Res. 307 (1) (2021)
Renata Sotirov
On solving the densest k-subgraph problem on large graphs. Optim. Methods Softw. 35 (6) (2020)
Frank de Meijer, Renata Sotirov
The quadratic cycle cover problem: special cases and efficient bounds. J. Comb. Optim. 39 (4) (2020)
Hao Hu, Renata Sotirov
On Solving the Quadratic Shortest Path Problem. INFORMS J. Comput. 32 (2) (2020)
Renata Sotirov
Graph bisection revisited. Ann. Oper. Res. 265 (1) (2018)
Hao Hu, Renata Sotirov
Special cases of the quadratic shortest path problem. J. Comb. Optim. 35 (3) (2018)
Franz Rendl, Renata Sotirov
The min-cut and vertex separator problem. Comput. Optim. Appl. 69 (1) (2018)
Hao Hu, Renata Sotirov
Special cases of the quadratic shortest path problem. CoRR (2016)
Edwin R. van Dam, Renata Sotirov
Semidefinite programming and eigenvalue bounds for the graph partition problem. Math. Program. 151 (2) (2015)
Jalal Ashayeri, Ning Ma, Renata Sotirov
Supply chain network downsizing with product line pruning using a new demand substitution. J. Oper. Res. Soc. 66 (10) (2015)
Edwin R. van Dam, Renata Sotirov
On Bounding the Bandwidth of Graphs with Symmetry. INFORMS J. Comput. 27 (1) (2015)
Etienne de Klerk, Renata Sotirov, Uwe Truetsch
A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives. INFORMS J. Comput. 27 (2) (2015)
Renata Sotirov
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem. INFORMS J. Comput. 26 (1) (2014)
Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov, Uwe Truetsch
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems. Eur. J. Oper. Res. 233 (3) (2014)
Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov
On semidefinite programming bounds for graph bandwidth. Optim. Methods Softw. 28 (3) (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136 (2) (2012)
Yuichi Takano, Renata Sotirov
A polynomial optimization approach to constant rebalanced portfolio selection. Comput. Optim. Appl. 52 (3) (2012)
Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov
Clique-based facets for the precedence constrained knapsack problem. Math. Program. 133 (1-2) (2012)
Edwin R. van Dam, Renata Sotirov
On bounding the bandwidth of graphs with symmetry CoRR (2012)
Etienne de Klerk, Renata Sotirov
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. Math. Program. 133 (1-2) (2012)
Jalal Ashayeri, Ning Ma, Renata Sotirov
An aggregated optimization model for multi-head SMD placements. Comput. Ind. Eng. 60 (1) (2011)
Etienne de Klerk, Renata Sotirov
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122 (2) (2010)
Amin Mobasher, Renata Sotirov, Amir K. Khandani
Matrix-lifting semi-definite programming for detection in multiple antenna systems. IEEE Trans. Signal Process. 58 (10) (2010)
Etienne de Klerk, Renata Sotirov
A new library of structured semidefinite programming instances. Optim. Methods Softw. 24 (6) (2009)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20 (2) (2009)
Etienne de Klerk, M. W. Newman, Dmitrii V. Pasechnik, Renata Sotirov
On the Lovász theta-number of almost regular graphs with application to Erdos-Rényi graphs. Eur. J. Comb. 30 (4) (2009)
Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19 (4) (2008)
Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani
A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming. IEEE Trans. Inf. Theory 53 (11) (2007)
Franz Rendl, Renata Sotirov
Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109 (2-3) (2007)
Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. Math. Program. 105 (2-3) (2006)
Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani
A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming CoRR (2005)
Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani
A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming. ISIT (2005)