A Deterministic Global Optimization Algorithm for Design Problems
From MaRDI portal
Publication:5421807
DOI10.1007/0-387-25570-2_10zbMath1136.90524OpenAlexW38163568MaRDI QIDQ5421807
Publication date: 24 October 2007
Published in: Essays and Surveys in Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-25570-2_10
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical optimization and variational techniques (65K10)
Related Items (8)
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ The small octagon with longest perimeter ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ A reliable affine relaxation method for global optimization ⋮ Design of space thrusters: a topology optimization problem solved via a branch and bound method ⋮ Isoperimetric polygons of maximum width ⋮ An interval branch and bound method for global robust optimization
Uses Software
This page was built for publication: A Deterministic Global Optimization Algorithm for Design Problems
