mes6@njit.edu   

Disclaimer : This website is going to be used for Academic Research Purposes.

Leaps-and-bounds Algorithm

An algorithm used to find the optimal solution in problems that may have a very large number of possible solutions. Begins by splitting the possible solutions into a number of exclusive subsets and limits the number of subsets that need to be examined in searching for the optimal solution by a number of different strategies.

Leaps-and-bounds Algorithm

Leave a Reply

Your email address will not be published. Required fields are marked *