default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenata Sotirov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Lennart Sinjorgo
, Renata Sotirov:
On Solving MAX-SAT Using Sum of Squares. INFORMS J. Comput. 36(2): 417-433 (2024)- [j37]Alireza Ghaffari-Hadigheh, Lennart Sinjorgo, Renata Sotirov:
On convergence of a q-random coordinate constrained algorithm for non-convex problems. J. Glob. Optim. 90(4): 843-868 (2024) - [j36]Frank de Meijer, Renata Sotirov:
On Integrality in Semidefinite Programming for Discrete Optimization. SIAM J. Optim. 34(1): 1071-1096 (2024) - 2023
- [j35]Frank de Meijer, Renata Sotirov, Angelika Wiegele, Shudian Zhao:
Partitioning through projections: Strong SDP bounds for large graph partition problems. Comput. Oper. Res. 151: 106088 (2023) - [j34]Hao Hu, Renata Sotirov, Henry Wolkowicz:
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. Math. Program. 200(1): 475-529 (2023) - 2022
- [j33]Abraham P. Punnen, Renata Sotirov:
Preface: Quadratic combinatorial optimization problems. Discret. Optim. 44(Part): 100688 (2022) - [j32]Olga Kuryatnikova, Renata Sotirov, Juan C. Vera:
The Maximum k-Colorable Subgraph Problem and Related Problems. INFORMS J. Comput. 34(1): 656-669 (2022) - [j31]Lennart Sinjorgo, Renata Sotirov:
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs. SIAM J. Optim. 32(2): 1344-1378 (2022) - 2021
- [j30]Hao Hu, Renata Sotirov:
The linearization problem of a binary quadratic problem and its applications. Ann. Oper. Res. 307(1): 229-249 (2021) - [j29]Franz Rendl, Renata Sotirov, Christian Truden:
Lower bounds for the bandwidth problem. Comput. Oper. Res. 135: 105422 (2021) - [j28]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): 1262-1276 (2021) - 2020
- [j27]Hao Hu, Renata Sotirov:
On Solving the Quadratic Shortest Path Problem. INFORMS J. Comput. 32(2): 219-233 (2020) - [j26]Frank de Meijer, Renata Sotirov:
The quadratic cycle cover problem: special cases and efficient bounds. J. Comb. Optim. 39(4): 1096-1128 (2020) - [j25]Renata Sotirov:
On solving the densest k-subgraph problem on large graphs. Optim. Methods Softw. 35(6): 1160-1178 (2020)
2010 – 2019
- 2018
- [j24]Renata Sotirov:
Graph bisection revisited. Ann. Oper. Res. 265(1): 143-154 (2018) - [j23]Franz Rendl, Renata Sotirov:
The min-cut and vertex separator problem. Comput. Optim. Appl. 69(1): 159-187 (2018) - [j22]Hao Hu, Renata Sotirov:
Special cases of the quadratic shortest path problem. J. Comb. Optim. 35(3): 754-777 (2018) - 2016
- [i3]Hao Hu, Renata Sotirov:
Special cases of the quadratic shortest path problem. CoRR abs/1611.07682 (2016) - 2015
- [j21]Edwin R. van Dam, Renata Sotirov:
On Bounding the Bandwidth of Graphs with Symmetry. INFORMS J. Comput. 27(1): 75-88 (2015) - [j20]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): 378-391 (2015) - [j19]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): 1699-1716 (2015) - [j18]Edwin R. van Dam, Renata Sotirov:
Semidefinite programming and eigenvalue bounds for the graph partition problem. Math. Program. 151(2): 379-404 (2015) - 2014
- [j17]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): 488-499 (2014) - [j16]Renata Sotirov:
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem. INFORMS J. Comput. 26(1): 16-30 (2014) - 2013
- [j15]Etienne de Klerk, Marianna E.-Nagy, Renata Sotirov:
On semidefinite programming bounds for graph bandwidth. Optim. Methods Softw. 28(3): 485-500 (2013) - 2012
- [j14]Yuichi Takano, Renata Sotirov:
A polynomial optimization approach to constant rebalanced portfolio selection. Comput. Optim. Appl. 52(3): 645-666 (2012) - [j13]Etienne de Klerk, Renata Sotirov:
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry. Math. Program. 133(1-2): 75-91 (2012) - [j12]Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov:
Clique-based facets for the precedence constrained knapsack problem. Math. Program. 133(1-2): 481-511 (2012) - [j11]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov, Cristian Dobre:
On semidefinite programming relaxations of maximum $$k$$ -section. Math. Program. 136(2): 253-278 (2012) - [i2]Edwin R. van Dam, Renata Sotirov:
On bounding the bandwidth of graphs with symmetry. CoRR abs/1212.0694 (2012) - 2011
- [j10]Jalal Ashayeri, Ning Ma, Renata Sotirov:
An aggregated optimization model for multi-head SMD placements. Comput. Ind. Eng. 60(1): 99-105 (2011) - 2010
- [j9]Etienne de Klerk, Renata Sotirov:
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122(2): 225-246 (2010) - [j8]Amin Mobasher, Renata Sotirov, Amir K. Khandani:
Matrix-lifting semi-definite programming for detection in multiple antenna systems. IEEE Trans. Signal Process. 58(10): 5178-5185 (2010)
2000 – 2009
- 2009
- [j7]Etienne de Klerk, Michael 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): 879-888 (2009) - [j6]Etienne de Klerk, Renata Sotirov:
A new library of structured semidefinite programming instances. Optim. Methods Softw. 24(6): 959-971 (2009) - [j5]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 20(2): 1132 (2009) - 2008
- [j4]Etienne de Klerk, Dmitrii V. Pasechnik, Renata Sotirov:
On Semidefinite Programming Relaxations of the Traveling Salesman Problem. SIAM J. Optim. 19(4): 1559-1573 (2008) - 2007
- [j3]Franz Rendl, Renata Sotirov:
Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109(2-3): 505-524 (2007) - [j2]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): 3869-3886 (2007) - 2006
- [j1]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): 451-469 (2006) - 2005
- [c1]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: 1686-1690 - [i1]Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani:
A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming. CoRR abs/cs/0510030 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
