Parametric Lagrangian dual for the binary quadratic programming problem
Based on a difference between convex decomposition of the Lagrangian function, we propose and study a family of parametric Lagrangian dual for the binary quadratic program. Then we show they improve several lower bounds in recent literature.
lagrangian dual binary quadratic program lower bound semidefinite programming d.c. decomposition 90c09 90c10 90c20