The following pages link to (Q4266762):
Displaying 31 items.
- Generating sum-of-ratios test problems in global optimization (Q597195) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- Computing non-dominated solutions in MOLFP (Q877640) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- A sequential method for a class of pseudoconcave fractional problems (Q940830) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Integer quadratic fractional programming problems with bounded variables (Q1730454) (← links)
- Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
- A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- A global optimization algorithm for linear fractional programming (Q2378922) (← links)
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
- Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
- Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- Global optimization algorithm for the nonlinear sum of ratios problem (Q5959898) (← 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)
