Pages that link to "Item:Q1957316"
From MaRDI portal
The following pages link to Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316):
Displaying 10 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)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← 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)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
