The following pages link to gaol (Q17725):
Displayed 13 items.
- Interval-based projection method for under-constrained numerical systems (Q487645) (← links)
- The design of the Boost interval arithmetic library (Q817867) (← links)
- Propagating systems of dense linear integer constraints (Q842789) (← links)
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
- An interval component for continuous constraints. (Q1421218) (← links)
- A certified branch \& bound approach for reliability-based optimization problems (Q1679494) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- First order rejection tests for multiple-objective optimization (Q2250111) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- Interval Subroutine Library Mission (Q5302763) (← links)
- Rigorous floating-point mixed-precision tuning (Q5370868) (← links)
- How do you compute the midpoint of an interval? (Q5498687) (← links)