Pages that link to "Item:Q1595900"
From MaRDI portal
The following pages link to Solving the sum-of-ratios problem by an interior-point method (Q1595900):
Displaying 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Global solutions to fractional programming problem with ratio of nonconvex functions (Q299415) (← links)
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← links)
- Minimization of isotonic functions composed of Fractions (Q613584) (← 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)
- Global optimization of nonlinear sum of ratios problem (Q702537) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- A reference point technique to compute nondominated solutions in MOLFP (Q844509) (← links)
- Computing non-dominated solutions in MOLFP (Q877640) (← links)
- Practical global optimization for multiview geometry (Q942843) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- Global optimization for sum of geometric fractional functions (Q983970) (← links)
- Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
- Solving sum of quadratic ratios fractional programs via monotonic function (Q1026289) (← links)
- Global optimization for a class of fractional programming problems (Q1037364) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- Integer quadratic fractional programming problems with bounded variables (Q1730454) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908) (← links)
- Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- A parametric solution method for a generalized fractional programming problem (Q2065366) (← 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)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- On solutions and duality of nonlinear nonsmooth fractional programs (Q2369231) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications (Q2417051) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- On solving the sum-of-ratios problem (Q2422872) (← 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)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
- Interference game for intelligent sensors in cyber-physical systems (Q2665160) (← links)
- A new efficient approach to tackle multi objective linear fractional problem with flexible constraints (Q2691377) (← links)
