Before revision: Given two point sets S and T, we first study the many-to-many matching with demands problem (MMD problem) . In an MMD, each point of one set must be matched to a given number of the points of the other set , and the cost of matching a point to another point is equal to the distance between the two points.
After revision: Given two point sets S and T, we first study the many-to-many matching with demands problem (MMD problem) where each point of one set must be matched to a given number of the points of the other set , and the cost of matching a point to another point is equal to the distance between the two points.