Pages that link to "Item:Q5421807"
From MaRDI portal
The following pages link to A Deterministic Global Optimization Algorithm for Design Problems (Q5421807):
Displaying 8 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)
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
- The small octagon with longest perimeter (Q857420) (← links)
- Isoperimetric polygons of maximum width (Q1006404) (← links)
- An interval branch and bound method for global robust optimization (Q2046260) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- Design of space thrusters: a topology optimization problem solved via a branch and bound method (Q5964242) (← links)