Pages that link to "Item:Q1316098"
From MaRDI portal
The following pages link to Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098):
Displaying 6 items.
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
