| A near-maximum-likelihood decoding algorithm for MIMO systems based on semi-definite programming A Mobasher, M Taherzadeh, R Sotirov, AK Khandani IEEE Transactions on Information Theory 53 (11), 3869-3886, 2007 | 137 | 2007 |
| Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem E De Klerk, R Sotirov Mathematical Programming 122, 225-246, 2010 | 130 | 2010 |
| Bounds for the quadratic assignment problem using the bundle method F Rendl, R Sotirov Mathematical programming 109, 505-524, 2007 | 104 | 2007 |
| Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition I Fischer, G Gruber, F Rendl, R Sotirov Mathematical Programming 105 (2), 451-469, 2006 | 98 | 2006 |
| Exploiting group symmetry in truss topology optimization Y Bai, E de Klerk, D Pasechnik, R Sotirov Optimization and Engineering 10, 331-349, 2009 | 60 | 2009 |
| On semidefinite programming relaxations of the traveling salesman problem E De Klerk, DV Pasechnik, R Sotirov SIAM Journal on Optimization 19 (4), 1559-1573, 2009 | 60 | 2009 |
| On solving the quadratic shortest path problem H Hu, R Sotirov INFORMS Journal on Computing 32 (2), 219-233, 2020 | 40 | 2020 |
| Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry E de Klerk, R Sotirov Mathematical programming 133, 75-91, 2012 | 40 | 2012 |
| An efficient semidefinite programming relaxation for the graph partition problem R Sotirov INFORMS Journal on Computing 26 (1), 16-30, 2014 | 35 | 2014 |
| Special cases of the quadratic shortest path problem H Hu, R Sotirov Journal of Combinatorial Optimization 35, 754-777, 2018 | 34 | 2018 |
| New bounds for the max-k-cut and chromatic number of a graph ER van Dam, R Sotirov Linear Algebra and its Applications 488, 216-234, 2016 | 32 | 2016 |
| The redesign of a warranty distribution network with recovery processes J Ashayeri, N Ma, R Sotirov Transportation Research Part E: Logistics and Transportation Review 77, 184-197, 2015 | 30 | 2015 |
| Clique-based facets for the precedence constrained knapsack problem N Boland, A Bley, C Fricke, G Froyland, R Sotirov Mathematical programming 133, 481-511, 2012 | 29 | 2012 |
| SDP relaxations for some combinatorial optimization problems R Sotirov Handbook on Semidefinite, Conic and Polynomial Optimization, 795-819, 2012 | 28 | 2012 |
| An aggregated optimization model for multi-head SMD placements J Ashayeri, N Ma, R Sotirov Computers & Industrial Engineering 60 (1), 99-105, 2011 | 26 | 2011 |
| The min-cut and vertex separator problem F Rendl, R Sotirov Computational Optimization and Applications 69 (1), 159-187, 2018 | 24 | 2018 |
| On solving the densest k-subgraph problem on large graphs R Sotirov Optimization Methods and Software 35 (6), 1160-1178, 2020 | 20 | 2020 |
| A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives E de Klerk, R Sotirov, U Truetsch INFORMS Journal on Computing 27 (2), 378-391, 2015 | 20 | 2015 |
| On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs E de Klerk, MW Newman, DV Pasechnik, R Sotirov European Journal of Combinatorics 30 (4), 879-888, 2009 | 19 | 2009 |
| Semidefinite programming and eigenvalue bounds for the graph partition problem ER Van Dam, R Sotirov Mathematical Programming 151, 379-404, 2015 | 17 | 2015 |
Etienne de KlerkProfessor, Tilburg UniversityVerificeret mail på uvt.nl
