The following pages link to (Q5421933):
Displaying 18 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Empirical convergence speed of inclusion functions for facility location problems (Q861908) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- The small octagons of maximal width (Q1953053) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- An interval inverse method based on high dimensional model representation and affine arithmetic (Q2306959) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- A general reliable quadratic form: An extension of affine arithmetic (Q2494411) (← links)
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context (Q2572918) (← links)
- Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- A Comparison of Methods for Solving Parametric Interval Linear Systems with General Dependencies (Q3075301) (← links)
- Deterministic global optimization using interval constraint propagation techniques (Q5693008) (← links)
