A note on a symmetrical set covering problem: The lottery problem

European Journal of Operational Research

Volumn 186, Issue 1, 2008, Pages 104-110

  Jans, Raf ^a   Degraeve, Zeger ^b  

^a ERASMUS UNIVERSITY   (Netherlands)

^b LONDON BUSINESS SCHOOL   (United Kingdom)

Author keywords

Integer programming; Lottery problem; Set covering problem; Symmetry

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING;

LOTTERY PROBLEMS; LOTTERY TICKETS; SET COVERING PROBLEMS;

SET THEORY;

EID: 35348968826     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.039     Document Type: Article

References (13)

1. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
2. Burger A.P., Gründlingh W.R., and van Vuuren J.H. Two combinatorial problems involving lottery schemes: Algorithmic determination of solution sets. Utilitas Mathematica 70 (2006) 33-70
3. Caprara A., Fischetti M., and Toth P. Algorithms for the Set Covering Problem. Annals of Operations Research 98 (2000) 353-371
4. Chlond M.J. Classroom Exercises in IP Modeling: Su Doku and The Log Pile. INFORMS Transactions on Education 5 2 (2005)
5. Chlond M.J., and Toase C.M. IP Modeling and the Logical Puzzles of Raymond Smullyan. INFORMS Transactions on Education 3 3 (2003)
6. Jans, R., Analysis of a symmetrical set covering problem: The lottery problem (in Dutch), Master's thesis, Department of Applied Economics, K.U. Leuven, Belgium, 1997; p. 60.
7. Li P.C., and van Rees G.H.J. Lower bounds on Lotto Designs. Congressum Numerantium 141 (1999) 5-30
8. Li P.C., and van Rees G.H.J. Lotto Design Tables. Journal of Combinatorial Designs 10 (2002) 335-359
9. Lan G., DePuy G.W., and Whitehouse G.E. An effective and simple heuristic for the set covering problem. European Journal of Operational Research 176 (2007) 1387-1403
10. Margot F. Small covering designs by branch-and-cut. Mathematical Programming 94 (2003) 207-220
11. Nurmela K.J., and Östergård P.R.J. Constructing covering designs by simulated annealing. Upper bounds of covering designs by simulated annealing. Congressus Numerantium 96 (1993) 93-111
12. Sherali H.D., and Smith J.C. Improving discrete model representations via symmetry considerations. Operations Research 47 10 (2001) 1396-1407
13. Sterboul F. Le Problème du Loto. Cahiers du Centre d'Etudes de Recherche Operationnelle (C.E.R.O.) 20 (1978) 443-449