IbexOpt
From MaRDI portal
Software:24260
No author found.
Related Items (13)
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ An interval extension based on occurrence grouping ⋮ A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure ⋮ Adaptive constructive interval disjunction: algorithms and experiments ⋮ Polytope-based computation of polynomial ranges ⋮ Interval methods for model qualification: methodology and advanced application ⋮ Upper bounding in inner regions for global optimization under inequality constraints ⋮ Interval-based projection method for under-constrained numerical systems ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Actions of the hyperoctahedral group to compute minimal contractors ⋮ The octagon abstract domain for continuous constraints
This page was built for software: IbexOpt
