Pages that link to "Item:Q473861"
From MaRDI portal
The following pages link to A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints (Q473861):
Displaying 15 items.
- A note on reduction of quadratic and bilinear programs with equality constraints (Q598586) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- A new branch and bound method with pretreatment for the binary quadratic programming (Q990519) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem (Q2886647) (← links)
- A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems (Q2886654) (← links)
- A new branch and bound algorithm for integer quadratic programming problems (Q3457925) (← links)
- (Q4996611) (← links)
- (Q5688490) (← links)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)