A note on a symmetrical set covering problem: The lottery problem
暂无分享,去创建一个
[1] François Margot,et al. Small covering designs by branch-and-cut , 2003, Math. Program..
[2] Pak Ching Li,et al. Lotto design tables , 2002 .
[3] Martin J. Chlond. Classroom Exercises in IP Modeling: Su Doku and the Log Pile , 2005 .
[4] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .
[5] Martin J. Chlond,et al. IP Modeling and the Logical Puzzles of Raymond Smullyan , 2003 .
[6] Guanghui Lan,et al. An effective and simple heuristic for the set covering problem , 2007, Eur. J. Oper. Res..
[7] Hanif D. Sherali,et al. Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..
[8] Matteo Fischetti,et al. Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..
[9] P. Östergård,et al. Upper Bounds for Covering Designs by Simulated Annealing , 1993 .