Pages that link to "Item:Q1785386"
From MaRDI portal
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 5 items.
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations (Q2866210) (← links)