Pages that link to "Item:Q312490"
From MaRDI portal
The following pages link to Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490):
Displaying 14 items.
- A class of problems that can be solved using interval algorithms (Q411419) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- An interval branch and bound algorithm for bound constrained optimization problems (Q1200632) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Combining interval branch and bound and stochastic search (Q1725151) (← links)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems (Q2423791) (← links)
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods (Q2568640) (← links)
- Interval computations, rigour and non-rigour in deterministic continuous global optimization (Q3093044) (← links)
- ICOS: a branch and bound based solver for rigorous global optimization (Q3396393) (← links)
- (Q4939281) (← links)
- Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems (Q5379671) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
