Pages that link to "Item:Q1721616"
From MaRDI portal
The following pages link to Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616):
Displaying 5 items.
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- (Q5038031) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
