Pages that link to "Item:Q3156718"
From MaRDI portal
The following pages link to Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718):
Displaying 4 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
