swMATH12331MaRDI QIDQ24260FDOQ24260
Author name not available (Why is that?)
Official website: http://www-sop.inria.fr/teams/coprin/neveu/contraintes/articles/ibexopt2012.pdf
Cited In (22)
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
- The octagon abstract domain for continuous constraints
- Polytope-based computation of polynomial ranges
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- An interval extension based on occurrence grouping
- Interval-based projection method for under-constrained numerical systems
- Upper bounding in inner regions for global optimization under inequality constraints
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- INTBIS
- ICOS
- COPRIN
- gaol
- AQCS
- IBEX
- Numerica
- DynIbex
- V-Clip
- Interval methods for model qualification: methodology and advanced application
- Adaptive constructive interval disjunction: algorithms and experiments
- Actions of the hyperoctahedral group to compute minimal contractors
This page was built for software: IbexOpt
