Dear Researchers, I need an algorithm to find a set of minimum edge weights (links) that consists of all four vertices (P1, P2, P3, P4) on the left side and only connecting vertices (G1, G2, G3, .....G11) from right side. More specifically, vertices (P1, P2, P3, P4) must be considered while from vertices (G1, G2, G3, ... G11) only four vertices should be considered where the total edge weight is minimum for entire subset.

I look at Hall's marriage theorem that provides perfect matching. But I need to choose all vertices from one side only.

Thanks for you cooperation.

Regards,

Rashid