The following pages link to (Q3175206):
Displaying 12 items.
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method (Q2263228) (← links)
- An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
- A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
- A denominators outcome-space branch and bound algorithm for solving linear fractional sum programming problems (Q2916527) (← links)
- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (Q3133219) (← links)
- A note on integer solutions to linear fractional interval programming problems by a branch & bound technique (Q3318562) (← links)
- (Q3811602) (← links)
- Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set (Q4507047) (← links)
- Efficient algorithm for globally computing the min–max linear fractional programming problem (Q6050611) (← links)
- Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← links)
- Global algorithm for effectively solving min-max affine fractional programs (Q6584742) (← links)
