Heuristic algorithm for solving the integer programming of the lottery problem

Sterboul, 1978, Le Problème du Loto, Cahiers du centre d’Etudes de Recherche Operationnelle (CERO), 20, 443 Li, 2002, Lotto design tables, Journal of Combinatorial Designs, 10, 335, 10.1002/jcd.10020 Li, P.C. “Some results on lotto designs”, Ph.D. Thesis, University of Manitoba (1999). Li, 1999, Lower bounds on lotto designs, Congressus Numerantium, 141, 5 Li, 2000, New constructions of lotto designs, Utilitas Mathematica, 58, 45 Jans, 2008, A note on a symmetrical set covering problem: the lottery problem, European Journal of Operational Research, 186, 104, 10.1016/j.ejor.2007.01.039 Aickelin, 2002, An indirect genetic algorithm for set covering problems, Journal of the Operational Research Society, 53, 1118, 10.1057/palgrave.jors.2601317 Bautista, 2007, A GRASP algorithm to solve the unicost set covering problem, Computers & Operations Research, 34, 3162, 10.1016/j.cor.2005.11.026 Beasley, 1987, An algorithm for the set covering problem, European Journal of Operational Research, 31, 85, 10.1016/0377-2217(87)90141-X Beasley, 1990, A Lagrangian heuristic for set covering problems, Naval Research Logistics, 37, 151, 10.1002/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2 Beasley, 1996, A genetic algorithm for the set covering problem, European Journal of Operational Research, 94, 392, 10.1016/0377-2217(95)00159-X Caprara, 1999, A heuristic method for the set covering problem, Operations Research, 47, 730, 10.1287/opre.47.5.730 Caprara, 2000, Algorithms for the set covering problem, Annals of Operations Research, 98, 353, 10.1023/A:1019225027893 Chvatal, 1979, A greedy heuristic for the set covering problem, Mathematics of Operations Research, 4, 233, 10.1287/moor.4.3.233 Fisher, 1990, Optimal solution of set covering partitioning problems using dual heuristic, Management Science, 36, 674, 10.1287/mnsc.36.6.674 Jacobs, 1995, Note: a local-search heuristic for large set-covering problems, Naval Research Logistics, 42, 1129, 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M Lan, 2007, An effective and simple heuristic for the set covering problem, European Journal of Operational Research, 176, 1387, 10.1016/j.ejor.2005.09.028 Nurmela, 1993, Constructing covering designs by simulated annealing. Upper bounds of covering designs by simulated annealing, Congressus Numerantium, 96, 93 Burger, 2006, Two combinatorial problems involving lottery schemes: algorithmic determination of solution set, Utilitas Mathematica, 70, 33 Sherali, 2001, Improving discrete model representations via symmetry considerations, Operations Research, 47, 1396