Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
From MaRDI portal
Recommendations
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
Cited in
(18)- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- An effective computational algorithm for the global solution of a class of linear fractional programming
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
- scientific article; zbMATH DE number 6907481 (Why is no real title available?)
- Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
This page was built for publication: Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501734)
