Pages that link to "Item:Q2088876"
From MaRDI portal
The following pages link to Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876):
Displaying 11 items.
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
- Global algorithm for effectively solving min-max affine fractional programs (Q6584742) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
