The following pages link to (Q5240428):
Displaying 8 items.
- 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)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000) (← links)
