The following pages link to quadprogIP (Q52029):
Displaying 10 items.
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← 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)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
