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

DOI10.1016/j.ejor.2007.01.039zbMath1138.90435OpenAlexW2005212395MaRDI QIDQ2462109

Raf Jans, Zeger Degraeve

Publication date: 23 November 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.039

zbMATH Keywords

symmetryinteger programmingset covering problemlottery problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations ⋮ Should European gamblers play lotto in the USA?

Cites Work

• An effective and simple heuristic for the set covering problem
• A genetic algorithm for the set covering problem
• Small covering designs by branch-and-cut
• Improving Discrete Model Representations via Symmetry Considerations
• Lotto design tables
• Algorithms for the set covering problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on a symmetrical set covering problem: the lottery problem