Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Tal Grossman
Information about the author Tal Grossman will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Computational experience with approximation algorithms for the set covering problem
1997
The Set Covering problem (SCP) is a well known combinatorial optimization problem,...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
