Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees

Memorization, as an algorithm design technique, enables to speed up algorithms at the price of increased space usage. In this work, we focus on search tree applied sequencing problems. these algorithms, lower branching levels, isomorphic sub-problems may appear exponentially many times and use memorization is twofold: one hand it avoids repetitive solutions, they correspond identical sub-problems; other hand, allows check for dominance conditions among permutations same subset elements. The idea appeared a long time, however, best authors’ knowledge, was only seldom in number proposed literature. paper, propose unifying framework implementing exact dedicated Our proposal leads paradigm Branch & Memorize its implementation three classical single machine problems validated by extensive computational experimentation that shows mentioned consistently improves existing algorithms. These results emphasize more systematically embedding