Algorítmos heurísticos para el problema del Set Covering: mejora mediante aleatorización
作者： Rosa González Silos
DOI:
关键词:
摘要:
参考文章(8)
Elena Marchiori, Adri G. Steenbeek, An Iterated Heuristic Algorithm for the Set Covering Problem Algorithm Engineering. pp. 155- 166 ,(1998)
M Haouari, J S Chaouachi, A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem Journal of the Operational Research Society. ,vol. 53, pp. 792- 799 ,(2002) , 10.1057/PALGRAVE.JORS.2601366
Larry W. Jacobs, Michael J. Brusco, Note: A local-search heuristic for large set-covering problems Naval Research Logistics. ,vol. 42, pp. 1129- 1140 ,(1995) , 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M
Guanghui Lan, Gail W. DePuy, Gary E. Whitehouse, An effective and simple heuristic for the set covering problem European Journal of Operational Research. ,vol. 176, pp. 1387- 1403 ,(2007) , 10.1016/J.EJOR.2005.09.028
Thomas A Feo, Mauricio G.C Resende, A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters. ,vol. 8, pp. 67- 71 ,(1989) , 10.1016/0167-6377(89)90002-3
Tal Grossman, Avishai Wool, Computational Experience with Approximation Algorithms for the Set Covering Problem European Journal of Operational Research. ,vol. 101, pp. 81- 92 ,(1994) , 10.1016/S0377-2217(96)00161-0
Joaquín Bautista, Jordi Pereira, A GRASP algorithm to solve the unicost set covering problem Computers & Operations Research. ,vol. 34, pp. 3162- 3173 ,(2007) , 10.1016/J.COR.2005.11.026
V. Chvatal, A Greedy Heuristic for the Set-Covering Problem Mathematics of Operations Research. ,vol. 4, pp. 233- 235 ,(1979) , 10.1287/MOOR.4.3.233