Author： Grossman T. Wool A.
Publisher： Elsevier
ISSN： 0377-2217
Source： European Journal of Operational Research, Vol.101, Iss.1, 1997-08, pp. : 81-92
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. :
An adaptation of SH heuristic to the location set covering problem
European Journal of Operational Research, Vol. 100, Iss. 3, 1997-08 ,pp. :
Simple Lagrangian heuristic for the set covering problem
By Haddadi S.
European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. :
Two linear approximation algorithms for the subset-sum problem
By Kellerer H. Mansini R. Speranza M.G.
European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. :