Pages that link to "Item:Q2802546"
From MaRDI portal
The following pages link to SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546):
Displaying 14 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Graph bisection revisited (Q1657405) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)