Pages that link to "Item:Q5063453"
From MaRDI portal
The following pages link to Solving generalized polynomial problem by using new affine relaxed technique (Q5063453):
Displaying 6 items.
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← 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)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- Generalized polynomial exponential sums and their fourth power mean (Q6153116) (← links)
