Pages that link to "Item:Q1256301"
From MaRDI portal
The following pages link to An interval arithmetic method for global optimization (Q1256301):
Displaying 16 items.
- An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming (Q458929) (← links)
- On constrained optimization by interval arithmetic and interval order relations (Q505105) (← links)
- Interval tools for global optimization (Q805166) (← links)
- A local exploration-based differential evolution algorithm for constrained global optimization (Q1004154) (← links)
- A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Nonlinear equations and optimization (Q1802504) (← links)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
- A hybrid global optimization method: The multi-dimensional case (Q1811602) (← links)
- A hybrid global optimization method: The one-dimensional case (Q1860412) (← links)
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
- Computable error bounds for an optimization problem with parallelepiped constraint (Q1899951) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- An interval global optimization algorithm for a class of functions with several variables (Q2638729) (← links)
- An efficient interval computing technique for bound-constrained uncertain optimization problems (Q2926481) (← links)
- (Q3119697) (← links)