Pages that link to "Item:Q1785386"

The following pages link to A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386):

Displaying 2 items.

• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)