Pages that link to "Item:Q598594"

The following pages link to A branch-and-bound algorithm for maximizing the sum of several linear ratios (Q598594):

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)
• Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← 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)
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
• Generating sum-of-ratios test problems in global optimization (Q597195) (← 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)
• 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)
• Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
• Generating the efficient set of multiobjective integer linear plus linear fractional programming problems (Q828869) (← links)
• A reference point technique to compute nondominated solutions in MOLFP (Q844509) (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
• A deterministic global optimization algorithm (Q870181) (← 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 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)
• Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) (← 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)
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← 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 iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
• Acceleration procedure for special classes of multi-extremal problems (Q2010137) (← links)
• Resource allocation: a common set of weights model (Q2061304) (← links)
• A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
• Convex envelopes for ray-concave functions (Q2080818) (← links)
• An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
• A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
• A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
• Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← 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)
• Global optimization for sum of generalized fractional functions (Q2479363) (← links)