The following pages link to (Q4400639):
Displaying 28 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs (Q421275) (← links)
- Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Realignment in the National Football League: Did they do it right? (Q4456091) (← links)
- Contribution of copositive formulations to the graph partitioning problem (Q4916308) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← 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)
- Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← links)
