Pages that link to "Item:Q2630836"
From MaRDI portal
The following pages link to Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836):
Displaying 10 items.
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems (Q1777422) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- (Q2994051) (← links)
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization (Q3058514) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)