Adding a new algorithm based on the paper: "Solving the Many to Many assignment"

[MightyArty]

Hello, my name is Tom and I'm a 3-year Computer Science student.
As a part of my last course at the University, I picked an interesting paper named: "Solving the Many to Many Assignment Problem by Improving the Kuhn–Munkres Algorithm with Backtracking", by the authors:

1. Haibin Zhu
2. Dongning Liu
3. Siqin Zhang
4. Yu Zhu
5. Luyao Teng
6. Shaohua Teng

My question is in which exact part of the library this algorithm could fit the most.

[Schefflera-Arboricola]

probably in a different module I think, or maybe in the matching module or the bipartite.matching, if it is bipartite specific. But, I think you would probably know the best.

• for reference: https://www.sciencedirect.com/science/article/pii/S0304397516000037
• related: What's the underlying algorithm of `min_weight_matching`? #5969
• maybe relevant(since matching and assignment problem are very similar): API consistency between bipartite/non-bipartite matching algorithms. #5823

Thank you :)