Pages that link to "Item:Q1938908"
From MaRDI portal
The following pages link to A practical but rigorous approach to sum-of-ratios optimization in geometric applications (Q1938908):
Displaying 8 items.
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- (Q3384769) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)