![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Figueiredo Celina M.H. Fonseca Guilherme D. Sa Vinicius G.P. Spinrad Jeremy
Publisher: Springer Publishing Company
ISSN: 0178-4617
Source: Algorithmica, Vol.46, Iss.2, 2006-10, pp. : 149-180
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Algorithms for the Set Covering Problem
By Caprara A.
Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the disjunctive set problem
Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Two Algorithms for the Multi-Weber Problem
By Harris B.
Annals of Operations Research, Vol. 123, Iss. 1-4, 2003-10 ,pp. :