Branch & Bound and Beam search algorithms were illustrated according to the feature selection domain. Presentation is structured as follows, - Motivation - Introduction - Analysis - Algorithm - Pseudo Code - Illustration of examples - Applications - Observations and Recommendations - Comparison between two algorithms - References