Pages that link to "Item:Q824489"
From MaRDI portal
The following pages link to Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489):
Displaying 15 items.
- Minimization of the sum of three linear fractional functions (Q1567073) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- A linearization to the multi-objective linear plus linear fractional program (Q6063798) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
- A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← links)
- Rank-two programs involving linear fractional functions (Q6581918) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
