Optimization from partial solution: minimize sum of distances between pairs

前端 未结 3 1246
粉色の甜心
粉色の甜心 2021-02-20 03:05

I have a problem which I like and I love to think about solutions, but I\'m stuck unfortunately. I hope you like it too. The problem states:

I have two lists of 2D point

3条回答
  •  名媛妹妹
    2021-02-20 03:40

    This problem is solvable in polynomial time via the Hungarian algorithm. To get a square matrix, add dummy entries to the shorter list at "distance 0" from everything.

提交回复
热议问题