A mathematical programming approach to the construction of BIBDs

International Journal of Computer Mathematics

Volumn 88, Issue 5, 2011, Pages 1067-1082

  Yokoya, Daisuke ^a   Yamada, Takeo ^a  

^a NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

BIBD; branch and bound method; MIP problem; tabu search

Indexed keywords

EID: 79952591994     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160.2010.492869     Document Type: Article

References (25)

1. I. Anderson, Combinatorial Designs and Tournaments, Oxford University Press, New York, 2006.
2. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, 2nd ed., Cambridge University Press, Cambridge, 1999.
3. N. L. Biggs, E. K. Lloyd, and R. J. Wilson, The history of combinatorics, in Handbook of Combinatorics, Vol. II, R. L. Graham, M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 2163-2198.
4. R. Bilous, C. W. H. Lam, L. H. Thiel, B. P. C. Li, G. H. J. van Rees, S. P. Radziszowski, W. H. Holzmann, and H. Kharaghani, There is no 2-(22, 8, 4) block design, J. Combin. Des. 15(2006), pp. 262-267. (Pubitemid 46721622)
5. P. Bofill, R. Guimera, and C. Torras, Comparison of simulated annealing and mean field annealing as applied to the generation of block designs, Neural Netw. 16(2003), pp. 1421-1428. (Pubitemid 37390840)
6. G. E. Box, W. G. Hunter, and J. S. Hunter, Statistics for Experimenters: Design, Innovation, and Discovering, 2nd ed., John Wily & Sons, Hoboken, 2005.
7. E. Brouwer, Block designs, in Handbook of Combinatorics, Vol. I, R. Graham, M. Gröetschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 693-771.
8. C. J. Colbourn and J. H. Dinitz, Handbook of Combinatorial Designs, 2nd ed., Chapman & Hall/CRC, New York, 2007.
9. CPLEX Ver. 11.0, ILOG, 2008. Available at http://www.ilog.com/products/ cplex/
10. D.-Z. du and F. K. Hwang, Combinatorial Group Testing and its Applications, 2nd ed., World Scientific Publication, Singapore, 2000.
11. F. Glover and M. Laguna, Tabu Search, Kluwer, Norwell, 1997.
12. M. Hall, Jr., Combinatorial Theory, 2nd ed., John Wiley & Sons, New York, 1998.
13. H. Hanani, The existence and construction of balanced incomplete block designs, Ann. Math. Stat. 32(1961), pp. 361-386.
14. H. Hanani, Balanced incomplete block designs and related designs, Discrete Math. 11(1975), pp. 255-369.
15. S. K. Houghten, L. H. Thiel, J. Janssen, and C. W. H. Lamet, There is no (46, 6, 1) block design, J. Combin. Des. 9(2001), pp. 60-71.
16. T. Kirkman, On a problem in combinations, Cambridge Dublin Math. J. 2(1847), pp. 191-204.
17. D. L. Kreher and D. R. Stinson, Combinatorial Algorithms: Generation, Enumeration and Search, CRC Press, Boca Raton, 1999.
18. T. Kurokawa and Y. Takefuji, Neural network parallel computing for BIBD problems, IEEE Trans. Circuits Syst. II 39(1992), pp. 243-247.
19. L. B. Morales, Constructing difference families through an optimization approach: Six new BIBDs, J. Combin. Des. 8(2000), pp. 261-273.
20. S. Prestwich, Balanced incomplete block design as satisfiability, Irish Conference on AI and Cognitive Science, Vol. 12, Cork, 2001, pp. 189-198.
21. S. Prestwich, A local search algorithm for balanced incomplete block designs, Lecture Notes in Artificial Intelligence, Cork Constraint Computation Centre, University College Cork, Cork, 2002.
22. V. N. Sachkov, Combinatorial Methods in Discrete Mathematics, Cambridge University Press, Cambridge, 1977.
23. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, Amsterdam, 1998.
24. R. Sedegewick, Algorithms in C, 3rd ed., Addison-Wesley, Boston, 1998.
25. D. R. Stinson, Combinatorial Designs: Construction and Analysis, Springer-Verlag, New York, 2004.