Pages that link to "Item:Q6106322"
From MaRDI portal
The following pages link to A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322):
Displaying 3 items.
- Efficient algorithm for globally computing the min–max linear fractional programming problem (Q6050611) (← links)
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (Q6569145) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)