The following pages link to ICOS (Q16197):
Displaying 15 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- Interval propagation and search on directed acyclic graphs for numerical constraint solving (Q1041436) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems (Q2022241) (← links)
- Solving kinematics problems by efficient interval partitioning (Q2443368) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- Exploiting Binary Floating-Point Representations for Constraint Propagation (Q2806863) (← links)
- Adaptive parameterized improving hit-and-run for global optimization (Q3396387) (← links)
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175) (← links)
- Global optimization (Q5896995) (← links)
