Branch and Bound Algorithm with Limited Memory

Since 2009 Another line of research was the development of a new metaheuristic approach for solving global optimization problems.The idea is to limit the available memory during the execution of a branch and bound algorithm based on interval analysis. Thus, instead of improving a local solution by metaheuristics such as Tabu or VNS, this approach begins with a deterministic and global approach that we transforms into a heuristic if all available memory is used. In addition, a study of complexity shows that setting the memory size available, the complexity of the new Branch and Bound algorithm is polynomial.