Reduction-branch-bound algorithm for solving sum of linear ratios problems
From MaRDI portal
Recommendations
- A new global algorithm for the sum of linear ratios problem
- A global optimization algorithm for sum of linear ratios problem
- A deterministic global optimization algorithm for sum of linear ratios problem
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- A reduced space branch and bound algorithm for a class of sum of ratios problems
Cited in
(15)- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An effective algorithm for globally solving sum of linear ratios problems
- A deterministic method for solving the sum of linear ratios problem
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A practicable branch and bound algorithm for sum of linear ratios problem
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- A numerical study on B\&B algorithms for solving sum-of-ratios problem
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- An exact method for solving the integer sum of linear ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
This page was built for publication: Reduction-branch-bound algorithm for solving sum of linear ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2951502)
