Pages that link to "Item:Q1424957"

The following pages link to Ellipsoidal approach to box-constrained quadratic problems (Q1424957):

Displaying 7 items.

• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• Convex programming with single separable constraint and bounded variables (Q885824) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
• Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)