Pages that link to "Item:Q2424762"
From MaRDI portal
The following pages link to A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762):
Displayed 7 items.
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← links)