Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. E. Balash and A. Ho. Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study. Math. Programming, 12:37–60, 1980.
2. J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.
3. J.E. Beasley, P.C. Chu. A Genetic Algorithm for the Set Covering Problem. European Journal of Operation Research, 94(2):394–404, 1996.
4. A. Caprara, M. Fischetti, P. Toth. Algorithms for the Set Covering Problem. Technical Report No. OR-98-3. DEIS-Operations Research Group, 1998.
5. V. Chvátal. A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, 4(3):233–235, 1979.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献