An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970354
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- A branch and bound algorithm for quantified quadratic programming
- An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- A practicable branch and bound algorithm for sum of linear ratios problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- scientific article; zbMATH DE number 6178192
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
Cited in
(5)- Extending the quadrangle inequality to speed-up dynamic programming
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
This page was built for publication: An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886647)
