Pages that link to "Item:Q1791410"
From MaRDI portal
The following pages link to A rank-two feasible direction algorithm for the binary quadratic programming (Q1791410):
Displaying 5 items.
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422) (← links)
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
- An efficient solution method for rank two quasiconcave minimization problems (Q4327903) (← links)