Relationship Between the One-dimensional Accurate Search Method and the Branch and Bound Algorithm
GU Min-na · 2005
A new algorithm is present,which is for solving global optimization problems.The 0.618, Fibonacci and dichotomy method in one-dimensional search is extended to the two-dimensional space. And if you compare this new method with the branch and bound algorithm,you ll find they have a lot in common.