Description: For set covering. Given an instance of I = ( X, F ), X is a finite set, F X a subset of the set, so that every element in X at least belong to an F element, that subset F covering X elements.Set cover problem is to find the subset of X, containing a number of at least a subset of C belongs to F, the C covering all elements in the X.
To Search:
File list (Check if you may need any files):
jihefugai\jihefugai.cpp
.........\readme.txt
jihefugai
Download