The following pages link to (Q4520756):
Displaying 18 items.
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- The small octagon with longest perimeter (Q857420) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Comparison between Baumann and admissible simplex forms in interval analysis (Q995937) (← links)
- A multivariate global optimization using linear bounding functions (Q1265194) (← links)
- The cluster problem in multivariate global optimization (Q1338540) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- Extremal problems for convex polygons (Q2460117) (← links)
- A general reliable quadratic form: An extension of affine arithmetic (Q2494411) (← links)
- A new inclusion function for optimization: kite -- the one-dimensional case (Q2574104) (← links)
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
- Efficiency of a Global Optimization Algorithm (Q3776516) (← links)
- Deterministic global optimization using interval constraint propagation techniques (Q5693008) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
