论文信息 - A note on a symmetrical set covering problem: The lottery problem

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

In a lottery, n numbers are drawn from a set of m numbers. On a lottery ticket we fill out n numbers. Consider the following problem: what is the minimum number of tickets so that there is at least one ticket with at least p matching numbers? We provide a set-covering formulation for this problem and characterize its LP solution. The existence of many symmetrical alternative solutions, makes this a very difficult problem to solve, as our computational results indicate.

Zeger Degraeve | Raf Jans

[1] François Margot,et al. Small covering designs by branch-and-cut , 2003, Math. Program..

[2] Pak Ching Li,et al. Lotto design tables , 2002 .

[3] Martin J. Chlond. Classroom Exercises in IP Modeling: Su Doku and the Log Pile , 2005 .

[4] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .

[5] Martin J. Chlond,et al. IP Modeling and the Logical Puzzles of Raymond Smullyan , 2003 .

[6] Guanghui Lan,et al. An effective and simple heuristic for the set covering problem , 2007, Eur. J. Oper. Res..

[7] Hanif D. Sherali,et al. Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[8] Matteo Fischetti,et al. Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[9] P. Östergård,et al. Upper Bounds for Covering Designs by Simulated Annealing , 1993 .