Pages that link to "Item:Q813372"
From MaRDI portal
The following pages link to Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372):
Displaying 16 items.
- A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
