Pages that link to "Item:Q454277"

The following pages link to On duality gap in binary quadratic programming (Q454277):

Displaying 8 items.

• New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← 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)
• Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
• On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)