The following pages link to Constructive Interval Disjunction (Q3523079):
Displayed 17 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)
- Interval methods for model qualification: methodology and advanced application (Q475446) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← 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)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
- Lie symmetries applied to interval integration (Q2166013) (← links)
- Improving inter-block backtracking with interval Newton (Q2267807) (← links)
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Range-only SLAM with indistinguishable landmarks; a constraint programming approach (Q2398514) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- Thick set inversion (Q2409673) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)