Pages that link to "Item:Q2492705"
From MaRDI portal
The following pages link to On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705):
Displaying 14 items.
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← 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)
- Immediate schedule adjustment and semidefinite relaxation (Q2313755) (← links)
- Causal state-feedback parameterizations in robust model predictive control (Q2628475) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
