Finding a min weight matching of a specific size

50 Views Asked by At

For a complete graph $G=(V,E)$, i want to find a minimim weighted matching of a size $n$ where $n \leq \lvert V \rvert$ is there any known algorithms for such a problem other than IP formulations?