Duality gap estimation of linear equality constrained binary quadratic programming
From MaRDI portal
Recommendations
- On duality gap in binary quadratic programming
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Parametric Lagrangian dual for the binary quadratic programming problem
- On reduction of duality gap in quadratic knapsack problems
Cited in
(10)- A distributed optimization approach via symmetric group actions under time-varying communication networks
- On reduction of duality gap in quadratic knapsack problems
- Parametric Lagrangian dual for the binary quadratic programming problem
- On linear conic relaxation of discrete quadratic programs
- On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint
- Tightening a copositive relaxation for standard quadratic optimization problems
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- On duality gap in binary quadratic programming
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- Immediate schedule adjustment and semidefinite relaxation
This page was built for publication: Duality gap estimation of linear equality constrained binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169124)
