Pages that link to "Item:Q2375741"
From MaRDI portal
The following pages link to A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741):
Displaying 5 items.
- Towards a closer integration of finite domain propagation and simplex-based algorithms (Q1265905) (← links)
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems (Q2657552) (← links)
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations (Q5138256) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← links)
