A note on a symmetrical set covering problem: The lottery problem
April 2008
Article
volume 186, issue 1 pp 104-110.
This publication is part of collection
| Related Files |
|---|
|
Redirect to Publishers version
(Publishers version.url.txt, 45 bytes) |
Repository contains one additional file which is not publicly available
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.
Keywords
