A Deterministic Global Optimization Algorithm for Design Problems
From MaRDI portal
Recommendations
- Deterministic global optimization using interval constraint propagation techniques
- Optimization of mechanical structures using interval analysis.
- Algorithm of global optimization for generalized geometric programming
- scientific article; zbMATH DE number 480288
- scientific article; zbMATH DE number 2068051
Cited in
(13)- Isoperimetric polygons of maximum width
- Global optimization algorithms for a CAD workstation
- An algorithm of global optimization for solving layout problems
- An interval branch and bound method for global robust optimization
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A general-purpose optimization program for engineering design
- A reliable affine relaxation method for global optimization
- Design of space thrusters: a topology optimization problem solved via a branch and bound method
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Hybridizing two linear relaxation techniques in interval-based solvers
- The small octagon with longest perimeter
- A deterministic global optimization algorithm
This page was built for publication: A Deterministic Global Optimization Algorithm for Design Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5421807)