Optimal multisections in interval branch-and-bound methods of global optimization
From MaRDI portal
Recommendations
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- What can interval analysis do for global optimization?
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- A multidimensional branch-and-prune method for interval global optimization
- New results on verified global optimization
Cited in
(9)- Combining interval branch and bound and stochastic search
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A new inclusion function for optimization: kite -- the one-dimensional case
- A multidimensional branch-and-prune method for interval global optimization
This page was built for publication: Optimal multisections in interval branch-and-bound methods of global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768626)
