Pages that link to "Item:Q3807879"

The following pages link to A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹ (Q3807879):

Displaying 10 items.

• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• On duality for Boolean programming (Q750292) (← links)
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
• Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
• Hidden convexity in some nonconvex quadratically constrained quadratic programming (Q1919813) (← links)
• Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• The Random QUBO (Q5050147) (← links)