The following pages link to (Q4352209):
Displaying 13 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Reverse logistics network design with stochastic lead times (Q850286) (← links)
- Global interval methods for local nonsmooth optimization (Q1292197) (← links)
- New interval analysis support functions using gradient information in a global minimization algorithm (Q1411328) (← links)
- An interval branch and bound method for global robust optimization (Q2046260) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers (Q2425163) (← links)
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization (Q2494289) (← links)
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
- Convex and concave relaxations of implicit functions (Q2943829) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem (Q6561239) (← links)
