Abstract: An algebraic model and an algorithm schema for search problems are presented. Specific algorithms are interpretations of the schema. As an example, a dynamic programming branch and bound algorithm for travelling salesman problem is used to illustrate how to obtain hybrid algorithms from the algorithm schema. Also discussed is how to program search problems with object oriented methodology. The algorithm schema not only provides a tool for automating algorithm design, but also provides a tool for software reusability.