Pages that link to "Item:Q4446320"
From MaRDI portal
The following pages link to A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS (Q4446320):
Displaying 8 items.
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- A novel auto-pruned ensemble clustering via SOCP (Q6608517) (← links)