Lotto design tables

Journal of Combinatorial Designs

Volumn 10, Issue 5, 2002, Pages 335-359

  Li, P C ^a   Van Rees, G H J ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Algorithm; Bound; Greedy; Heuristic; Lottery; Lotto design; Recursive; Simulated annealing backtrack; Tables

Indexed keywords

EID: 0344155080     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.10020     Document Type: Article

References (19)

1. J. A. Bate, A generalized covering problem, PhD Thesis, University of Manitoba, 1978.
2. J. A. Bate and G. H. J. van Rees, Lotto Designs, The Journal of Combinatorial Mathematics and Combinatorial Computing 28 (1998), 15-39.
3. I. Bluskov, Private Communication.
4. E. D. Boyer, D. L. Kreher, S. P. Radziszowski, J. Zou, and A. Sidorenko, On (n, 5, 3)- Turan systems, Ars Combinatoria 37 (1994), 13-31.
5. A. E. Brouwer, Some lotto numbers from an extension of Turans theorem, Math Center (Amsterdam) Report, 1978.
6. A. E. Brouwer and M. Voorhoeve. Turan theory and the lotto problem, Math Center Tracts 106 (1979), 99-105.
7. C. J. Colbourn and J. H. Dinitz, The CRC handbook of combinatorial designs, CRC Press, Boca Raton, 1996.
8. Z. Furedi, G. Szekely, and Z. Zubor, On the lottery problem, J Combin Designs 4 (1996), 5-10. (Pubitemid 126567056)
9. D. M. Gordon, O. Patashnik, and G. Kuperberg, New constructions for covering designs, J Combin Designs 3(4) (1995), 269-284.
10. D. M. Gordon, WebSite of covering bounds at: http://www.ccrwest.org/ cover.html
11. H. Hanani, D. Ornstein, and V. T. Sos, On the lottery problem, Magyar Tud Acad Mat Kutato 9 (1964), 155-158.
12. D. L. Kreher and D. R. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, 1999.
13. P. C. Li, Some results on lotto designs, PhD Thesis, University of Manitoba, 1999.
14. P. C. Li, WebSite of lotto design bounds at: http://www.cs.umanitoba.ca/- lipakc/lottotables.html
15. P. C. Li and G. H. J. van Rees, Lower bounds on lotto designs, Congressus Numerantium 141 (1999), 5-30.
16. P. C. Li and G. H. J. van Rees, New constructions of lotto designs, Utilitas Mathematica 58 (2000), 45-64. (Pubitemid 33222926)
17. K. J. Nurmela and P. R. J. O stergard, Upper bounds for covering designs by simulated annealing, Congressus Numerantium 96 (1993), 93-111.
18. J. Schonheim, On coverings, Pac J Math 14 (1964), 1405-1411.
19. P. Turan, On the theory of graphs, Coll Math 3 (1954), 19-30.