The following pages link to IbexOpt (Q24260):
Displaying 13 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- An interval extension based on occurrence grouping (Q411420) (← links)
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure (Q411447) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- Interval methods for model qualification: methodology and advanced application (Q475446) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- Interval-based projection method for under-constrained numerical systems (Q487645) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- Actions of the hyperoctahedral group to compute minimal contractors (Q2093397) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- The octagon abstract domain for continuous constraints (Q2342596) (← links)
