Pages that link to "Item:Q4634098"
From MaRDI portal
The following pages link to Solving Quadratic Programming by Cutting Planes (Q4634098):
Displaying 7 items.
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
