| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 477717 | European Journal of Operational Research | 2008 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Raf Jans, Zeger Degraeve,