In a complete bipartite graph with vertex sets of cardinalities $n$ and $m$, assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as $n\rightarrow\infty$, with $m = \lceil n/α\rceil$ for any fixed $α>1$, the minimum weight of many-to-one matchings converges to a constant (depending on $α$). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge-cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.