Man Nguyen Van Minh
Orthogonal arrays are combinatorial structures which are interesting
both from theoretical
and practical viewpoints. We introduce an algebraic approach to their
Our method is applicable for any type of orthogonal array, but it is
less effective in finding arrays with large run sizes.
The methods to be discussed include converting the construction problem to an integer programming problem and using the symmetry of the original array to prune the solution space. We use this approach to enumerate all orthogonal arrays of runsize at most 60 and strength 3.
back to TU/e Combinatorial Theory Seminar announcements