Minimum set cover bipartite graph

Is there an implemented way to find the minimum set cover in a bipartite graph.

Example: Minimum set of suppliers that offers the whole set of necessary products.