Pages that link to "Item:Q5962186"
From MaRDI portal
The following pages link to A new algorithm for the general quadratic programming problems with box constraints (Q5962186):
Displaying 11 items.
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A new branch and bound method with pretreatment for the binary quadratic programming (Q990519) (← links)
- An efficient algorithm for solving semi-infinite inequality problems with box constraints (Q1334924) (← links)
- A general solution to least squares problems with box constraints and its applications (Q1793094) (← links)
- A sequential method for a class of box constrained quadratic programming problems (Q2483014) (← links)
- (Q3348711) (← links)
- Generating box-constrained optimization problems (Q3840044) (← links)
- New algorithms for maximization of concave functions with box constraints (Q4021561) (← links)
- (Q4795625) (← links)
- (Q4980087) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)