Pages that link to "Item:Q4197634"
From MaRDI portal
The following pages link to The Indefinite Quadratic Programming Problem (Q4197634):
Displaying 13 items.
- On the global minimization of concave functions (Q800693) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- A finite cutting plane method for facial disjunctive programs (Q3971356) (← links)
- An algorithm for piece-wise indefinite quadratic programming problem (Q5147642) (← links)
