Pages that link to "Item:Q1567073"

The following pages link to Minimization of the sum of three linear fractional functions (Q1567073):

Displaying 37 items.

• A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
• A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• Generating sum-of-ratios test problems in global optimization (Q597195) (← 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)
• Generating the efficient set of multiobjective integer linear plus linear fractional programming problems (Q828869) (← links)
• A deterministic global optimization algorithm (Q870181) (← links)
• Computing non-dominated solutions in MOLFP (Q877640) (← 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)
• Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm (Q1044764) (← links)
• A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
• Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
• Integer quadratic fractional programming problems with bounded variables (Q1730454) (← 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 effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
• Global optimization for the sum of generalized polynomial fractional functions (Q2460040) (← links)
• Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
• Global optimization for sum of generalized fractional functions (Q2479363) (← links)
• Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
• A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656) (← links)
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
• (Q3384769) (← links)
• A sixth bibliography of fractional programming (Q3426331) (← links)
• Massimo della somma tra una funzione lineare ed una funzione lineare fratta (Q3690601) (← 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)