Matching with specific cardinality

In a weighted graph $G(mathcal{V},mathcal{E})$ where $w(i,j)$ is the weight of the edge $(i,j) in mathcal{E}$. How can I find a maximum weighted matching with a specific size (i.e specific cardinality).