Pages that link to "Item:Q1768626"
From MaRDI portal
The following pages link to Optimal multisections in interval branch-and-bound methods of global optimization (Q1768626):
Displaying 8 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests (Q1580430) (← links)
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (Q1583690) (← links)
- Combining interval branch and bound and stochastic search (Q1725151) (← links)
- Optimal centers in branch-and-prune algorithms for univariate global optimization (Q2572338) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)