Pages that link to "Item:Q609569"
From MaRDI portal
The following pages link to An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569):
Displaying 4 items.
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
