Author:
Xu Qingyuan,Tan Anhui,Lin Yaojin
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Software
Reference51 articles.
1. Balas E (1982) Class of location, distribution and scheduling problems: modeling and solution methods. Carnegie Mellon University, Design Research Center, New York
2. Bautista J, Pereira J (2007) A GRASP algorithm to solve the unicost set covering problem. Comput Operation Res 34(10):3162–3173
3. Bilal N, Galinier P, Guibault F (2013) A new formulation of the set covering problem for metaheuristic approaches. Hindawi Publishing Corporation, ISRN Operations Research, Volume 2013, Article ID 203032, p 10. doi: 10.1155/2013/203032
4. Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Operat Res 47(5):730–743
5. Chen DG, Zhao SY, Zhang L et al (2012) Sample pair selection for attribute reduction with rough set. IEEE Transac Know Data Eng 24(11):2080–2093
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献