Pages that link to "Item:Q691453"
From MaRDI portal
The following pages link to An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453):
Displaying 5 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)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
