1Ma Y, Yang C, Zhang M. A Genetic Algorithm for Time-Satisfac- tion-Based Set Covering Location Problem [C].IEEE 2005 Internation- al Conference on Communications, Circuits and Systems Proceedings, HongKong, China, 2005, ( 20 ). 被引量：1
2Hassin R, Segev D. The Multi-radius Cover Problem [C].Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS' 05), 2005. 被引量：1
3Hassin R, Segev D. Rounding to an Integral Program [C].Proceedings of the 4th International Workshop on Efficient and Experimental Algo- rithms (WEA' 05), 2005. 被引量：1
4Mestre J. On the Multi-radius Cover Problem [J].Information Process- ing Letters, 2006, (99). 被引量：1
5Beasley J E, Chu P C. A Genetic Algorithm for the Set Covering Prob- lem [J].European Journal of Operational Research, 1996, 94(2). 被引量：1
6Solar M, Parada V, Urrutia R. A Parallel Genetic Algorithm to Solve the Set-covering Problem [J].Computer Operational Research, 2002, 29(9). 被引量：1
7Jaramillo J H, Bhadury J, Batta R. On the Use of Genetic Algorithms to Solve Location Problems[J].Computers & Operations Research, 2002, 29(6). 被引量：1
