Pages that link to "Item:Q4646674"
From MaRDI portal
The following pages link to A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674):
Displaying 8 items.
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
