Hello ,JanJan wrote:Is it a simple matching or weighted matching? You can find weighted matching by dp. The algorithm takes O(n^2 * 2^n) time.
I use MaximumFlowMinimumCost method to solve this problem.
But could you show me how to apply DP on this problem briefly?
thanks a lot:)