The following pages link to (Q4949361):
Displayed 9 items.
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques (Q547885) (← links)
- Contractor programming (Q840818) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions (Q968347) (← links)
- Efficient handling of universally quantified inequalities (Q1020499) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A generic interval branch and bound algorithm for parameter estimation (Q2416576) (← links)