The following pages link to (Q5425124):
Displaying 7 items.
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- A feasible direction method for the semidefinite program with box constraints (Q654206) (← links)
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)