Pages that link to "Item:Q1713180"
From MaRDI portal
The following pages link to Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180):
Displaying 27 items.
- Range division and contraction algorithm for a class of global optimization problems (Q279507) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← 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 outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← 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)
- Ratio-conjugation tool and its application in linear optimization models† (Q3426328) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← 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)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← 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)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
