Pages that link to "Item:Q711696"

The following pages link to Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696):

Displaying 13 items.

• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← 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 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)
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
• A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
• Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
• An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)