The following pages link to Renata Sotirov (Q296967):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- (Q1024279) (redirect page) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design (Q1026924) (← links)
- Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
- Graph bisection revisited (Q1657405) (← links)
- Special cases of the quadratic shortest path problem (Q1743483) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- On Bounding the Bandwidth of Graphs with Symmetry (Q2942684) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming (Q3548916) (← links)
- Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3563925) (← links)
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem (Q3648520) (← links)
- Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems (Q4570572) (← links)
- (Q4702451) (← links)
- Multi-start approach for an integer determinant maximization problem (Q4916310) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- (Q5482472) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- Worst-case CVaR based portfolio optimization models with applications to scenario planning (Q5891578) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- The maximum $k$-colorable subgraph problem and related problems (Q6333536) (← links)
- SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning (Q6348662) (← links)
- The quadratic minimum spanning tree problem: lower bounds via extended formulations (Q6505062) (← links)
- On convergence of a $q$-random coordinate constrained algorithm for non-convex problems (Q6506828) (← links)
- Exploiting Symmetries in Optimal Quantum Circuit Design (Q6517562) (← links)
- Cuts and semidefinite liftings for the complex cut polytope (Q6520728) (← links)
- On solving MAX-SAT using sum of squares (Q6580533) (← links)
