68 citations · 142 across the 15 of their papers we have counts for
5 papers · 1 filter
Legendre pairs of lengths (mod 5)
Ilias Kotsireas, Christoph Koutschan, Dursun Bulutoglu +3
By assuming a type of balance for length and non-trivial subgroups of multiplier groups of Legendre pairs (LPs) for length , we find LPs of these lengths. We the…
Algorithms for finding generalized minimum aberration designs
Dursun A. Bulutoglu, Kenneth J. Ryan
Statistical design of experiments is widely used in scientific and industrial investigations. A generalized minimum aberration (GMA) orthogonal array is optimum under the well-esta…
The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program
David M. Arquette, Dursun A. Bulutoglu
There is always a natural embedding of into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) f…
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
Andrew J. Geyer, Dursun A. Bulutoglu, Kenneth J. Ryan
For a given linear program (LP) a permutation of its variables that sends feasible points to feasible points and preserves the objective function value of each of its feasible poin…
Legendre pair of length using complementary binary matrices with fixed marginals
Jonathan Turner, Ilias Kotsireas, Dursun Bulutoglu +1
We provide a search method for Legendre pairs of composite length based on generating binary matrices with fixed row and column sums from compressed, complementary integer vectors.…