Author:
Crawford Broderick,Soto Ricardo,Riquelme-Leiva Marco,Peña Cristian,Torres-Rojas Claudio,Johnson Franklin,Paredes Fernando
Publisher
Springer International Publishing
Reference30 articles.
1. Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity 4(7), 944–950 (2010)
2. Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research 44(6), 875–890 (1996)
3. Mathematical Programming Studies;E. Balas,1980
4. Beasley, J.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1), 151–164 (1990)
5. Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献