I am trying to find the minimum cost of moving source samples in 2D to target samples so that all target samples are covered and all source samples do not need to be moved. Is this falling under optimal transport at all or is this some sort of assignment problem (Hungarian algorithm etc.)?

For example adjusting your 20 sample vs 20 sample examples here: https://pythonot.github.io/auto_examples/plot_OT_L1_vs_L2.html

I want to find the minimum cost (let's say euclidean) of covering the 7 target samples using the 20 source samples in however way.

I expect 13 samples to be unmoved (because 7 is enough) but here is the result:

Can I achieve this with POT?