Pages that link to "Item:Q1969464"
From MaRDI portal
The following pages link to Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464):
Displaying 5 items.
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
