The following pages link to (Q5465121):
Displaying 16 items.
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- A tight semidefinite relaxation of the MAX CUT problem (Q1417849) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- (Q3093399) (← links)
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies (Q3451762) (← links)
- (Q4400647) (← links)
- (Q5425124) (← links)
- Synchronous values of games (Q6617161) (← links)
