Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference12 articles.
1. An indirect genetic algorithm for set covering problems;Aickelin;J Oper Res Soc,2002
2. An improved hybrid algorithm for the set covering problem;Al-Shihabi;Comput Ind Eng,2015
3. A greedier approach for finding tag SNPs;Chang;Bioinformatics,2006
4. Crawford B, Castro C. Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems. In: Proceedings of 8th international conference on artificial intelligence and soft computing-ICAISC 2006, Zakopane, Poland, June 25–29, 2006; 2006. p. 1082–90.
5. Hall N, Hochbaum D. The multicovering problem: the use of heuristics, cutting planes, and subgradient optimization for a class of integer programs. Technical report, UC Berkeley; 1983.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献