Pages that link to "Item:Q2392111"
From MaRDI portal
The following pages link to Branch-reduction-bound algorithm for generalized geometric programming (Q2392111):
Displaying 13 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
