Pages that link to "Item:Q2075981"
From MaRDI portal
The following pages link to A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981):
Displaying 7 items.
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← 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)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
