A mathematical programming approach to the construction of BIBDs

A balanced incomplete block design (BIBD) is instrumental in design of experiments. This is usually constructed by algebraic methods such as finite algebra or difference sets. However, in algebraic approaches, no unified method exists, and each BIBD has been constructed in some ad hoc ways. On the other hand, computer-based methods apply the same algorithm to all BIBDs; hence, these are unified approaches. Although various meta-heuristic algorithms have been tried, the success of these methods has been rather limited. This article presents an alternative approach to this problem that formulates the problem as a nonlinear mixed integer programming problem. We develop a branch-and-bound algorithm to solve this, and a tabu search algorithm to overcome some weakness in the former algorithm. We compare the performance of these algorithms against some previously developed algorithms, and demonstrate that our algorithms are competitive to these methods.

[1]  J. S. Hunter,et al.  Statistics for Experimenters: Design, Innovation, and Discovery , 2006 .

[2]  H. Hanani.  The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[3]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[4]  Robin Wilson,et al.  The history of combinatorics , 1996 .

[5]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[6]  Robert Winter,et al.  Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theory , 2008, 0812.3731.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Carme Torras,et al.  Comparison of simulated annealing and mean field annealing as applied to the generation of block designs , 2003, Neural Networks.

[9]  Luis B. Morales,et al.  Constructing difference families through an optimization approach: Six new BIBDs , 2000 .

[10]  V.E.Adler,et al.  Q4 , 2003, nlin/0309030.

[11]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[12]  Steven David Prestwich.  A Local Search Algorithm for Balanced Incomplete Block Designs , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[13]  Andries E. Brouwer,et al.  Block designs , 1996 .

[14]  Larry H. Thiel,et al.  There is no 2-(22, 8, 4) block design , 2007 .

[15]  Takakazu Kurokawa,et al.  Neural network parallel computing for BIBD problems , 1992 .

[16]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[17]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[18]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[19]  S. Houghten,et al.  There is no (46, 6, 1) block design* , 2001 .

[20]  V. Sachkov.  Combinatorial Methods in Discrete Mathematics , 1996 .

[21]  Jr. Hall.  Combinatorial theory (2nd ed.) , 1998 .

[22]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

[23]  Robert Sedgewick,et al.  Algorithms in C , 1990 .