Simplified Memory-Bounded Algorithm

The Simplified Memory-Bounded Algorithm (SMA *) is an algorithm for memory-optimized searches in trees . It is a special case of the A * algorithm for calculating a shortest path .

If the area to be examined tree with a greedy algorithm is searched and not enough memory is available to hold the whole tree in memory, unfavorable nodes or subtrees are initially ignored. Information about the costs of the subtree is saved in the previous node. If no better result is achieved with the remaining subtrees, the calculation can be restarted at the cheap forgotten nodes. The saving effect on memory consumption results from the fact that less promising solution variants are initially not kept in memory.