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.
| Original language | English |
|---|---|
| Pages (from-to) | 104-110 |
| Number of pages | 7 |
| Journal | European Journal of Operational Research |
| Volume | 186 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2008 |
Research programs
- RSM LIS
Fingerprint
Dive into the research topics of 'A note on a symmetrical set covering problem: The lottery problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver