Pages that link to "Item:Q2886647"
From MaRDI portal
The following pages link to An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem (Q2886647):
Displaying 4 items.
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Extending the quadrangle inequality to speed-up dynamic programming (Q1321816) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)