Pages that link to "Item:Q304230"
From MaRDI portal
The following pages link to An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230):
Displaying 5 items.
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method (Q4888148) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)