References
- Bofill, P., Guimera, R., Torras, C. (2003). Comparison of simulated annealing and mean field annealing as applied to the generation of block designs, Neural Network 16:1421–1428.
- Colbourn, C.J., Dinitz, J.H. (2007). Handbook of Combinatorial Designs. (2nd ed.). New York: Chapman & Hall.
- Hall, M. Jr. (1998). Combinatorial Theory. (2nd ed.). NewYork: John Wiley & Sons.
- Hanani, H. (1961). The existence and construction of balanced incomplete block designs, Annals of Mathematical Statistics 32:361–386.
- Hanani, H. (1975). Balanced incomplete block designs and related designs, Discrete Mathematics 11:255–369.
- Kirkman, T. (1847). On a problem in combinations, Cambridge Dublin Mathematical Journal 2:191–204.
- Kreher, D.L., Stinson, D.R. (1999). Combinatorial Algorithms: Generation, Enumeration and Search. Boca Raton: CRC Press.
- Kurokawa, T., Takefuji, Y. (1992). Neural network parallel computing for BIBD problems. IEEE Transactions Circuits Systems, II 39:243–247.
- Prestwich, S. (2001). Balanced incomplete block design as satisfiability, Irish Conference on AI and Cognitive Science 12:Cork, 189–198.
- Yokoya, D., Yamada, T. (2011). A mathematical programming approach to construction of BIBDs. International Journal of Computational Mathematics 88(5):1067–1082.