zbMATH — the first resource for mathematics

Linear integer programming approach to construction of balanced incomplete block designs. (English) Zbl 1321.62100
Summary: This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs. Working of the algorithm is illustrated with the help of an example. The algorithm is able to generate balanced incomplete block designs very fast in most of the cases. The performance of the proposed algorithm is compared with other algorithms proposed in the literature. It is demonstrated that the proposed algorithm is competitive with the existing algorithms.

62K10 Statistical block designs
90C10 Integer programming
Full Text: DOI
[1] DOI: 10.1016/j.neunet.2003.07.003 · Zbl 02060405 · doi:10.1016/j.neunet.2003.07.003
[2] Colbourn C.J., Handbook of Combinatorial Designs. (2nd ed.) (2007) · Zbl 1101.05001
[3] Hall M., Combinatorial Theory. (2nd ed.) (1998)
[4] DOI: 10.1214/aoms/1177705047 · Zbl 0107.36102 · doi:10.1214/aoms/1177705047
[5] DOI: 10.1016/0012-365X(75)90040-0 · Zbl 0361.62067 · doi:10.1016/0012-365X(75)90040-0
[6] Kirkman T., Cambridge Dublin Mathematical Journal 2 pp 191– (1847)
[7] Kreher D.L., Combinatorial Algorithms: Generation, Enumeration and Search (1999) · Zbl 0911.05002
[8] DOI: 10.1109/82.136575 · Zbl 0792.68126 · doi:10.1109/82.136575
[9] Prestwich S., Irish Conference on AI and Cognitive Science 12 pp 189– (2001)
[10] DOI: 10.1080/00207160.2010.492869 · Zbl 1216.90062 · doi:10.1080/00207160.2010.492869
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.