The classification of combinatorial objects consists of two sub-problems – construction of objects with given properties and rejection of isomorphic objects. In this paper, we consider generation of combinatorial objects that are uniquely defined by a matrix. The method that we present is implemented by backtrack search. The used approach is close to dynamic programming.