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

RF Jans, Zeger Degraeve

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)104-110
Number of pages7
JournalEuropean Journal of Operational Research
Volume186
Issue number1
DOIs
Publication statusPublished - 2008

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