The following pages link to (Q4980087):
Displaying 8 items.
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483) (← links)
- A new algorithm for the general quadratic programming problems with box constraints (Q5962186) (← links)
