Author： Li L. Kabadi S.N. Nair K.P.K.
Publisher： Elsevier
ISSN： 0377-2217
Source： European Journal of Operational Research, Vol.137, Iss.1, 2002-02, pp. : 93-109
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A genetic algorithm for the set covering problem
European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. :
Access to resources
Recommend
An efficient mean field approach to the set covering problem
By Ohlsson M. Peterson C. Soderberg B.
European Journal of Operational Research, Vol. 133, Iss. 3, 2001-09 ,pp. :
The gradual covering decay location problem on a network
By Berman O. Krass D. Drezner Z.
European Journal of Operational Research, Vol. 151, Iss. 3, 2003-12 ,pp. :
A Lagrangean heuristic for the maximal covering location problem
European Journal of Operational Research, Vol. 88, Iss. 1, 1996-01 ,pp. :
An adaptation of SH heuristic to the location set covering problem
European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. :