ABSTRACT

This chapter outlines some of the main computational methods that have been successful in solving existence and enumeration problems in combinatorial design theory. Issues related to the validation of search results are also discussed.