Pages that link to "Item:Q881518"

The following pages link to A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518):

Displaying 30 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)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• An outcome space approach for generalized convex multiplicative programs (Q969745) (← 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)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
• Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
• A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• Parameterized approximations for the two-sided assortment optimization (Q2157918) (← links)
• An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region (Q2511139) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
• A new efficient approach to tackle multi objective linear fractional problem with flexible constraints (Q2691377) (← links)
• Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
• On the quadratic fractional optimization with a strictly convex quadratic constraint (Q2948116) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)