title: Match every point in two different sized sets with minimum total line length
body: <p>I have two sets of points plotted in a coordinate system. Each point in a set must be matched to <em>at least</em> one point at the other set, in a way that the sum of the length of the lines drawn by joining those points should be as low as possible. To make it clear, line drawing is just an abstraction, the actual output is just the pairs of points that must be matched.</p>
  
  <p>I've seen <a href="https://stackoverflow.com/questions/10174779/how-to-find-the-minimum-cost-of-linking-two-sets-of-points">this question</a> about a similar problem, except that in my case there's no single-link restriction since the sets may have different sizes. Is there any kind of problem that describes this situation? More specifically, what algorithm could I use to solve this, assuming each set may have a maximum of 10 points?</p>