Author:
Alexandrov Dmitri,Kochetov Yuri
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Balas, E.; Carrera, M. C. (1996): A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Operations Research, Vol. 44, pp. 875–890.
2. Beasley, J. E.; Chu, P. C. (1996): A Genetic Algorithm for the Set Covering Problem. European Journal of Operational Research, Vol. 94, No. 2, pp. 394–404.
3. Chvatal, V. (1979): A Greedy Heuristic for the Set Covering Problem. Mathematics of Operations Research, Vol. 4, No. 3, pp. 233–235.
4. Dorigo, M.; Maniezzo, V.; Colorny, A. (1991): Ant System: An Autocatalytic Optimizing Process. Technical Report No. 91-016, Politecnico di Milano.
5. Eremeev, A. V. (1999): Genetic Algorithm with a Non-Binary Representation for the Set Covering Problem. Operations Research Proceedings 1998, Springer-Verlag, pp. 175–181.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献