azmisov / auctionassignment Goto Github PK

Hello, thank you very much for sharing the code. I have a question. What is the get_max_pairing() function in the code and what does it mean??
Thank you !!

Hello, I recently ran your program to solve my own project. I used the simplest example: 3 objects and 2 persons. The following problems will occur, so I would like to ask you, thank you!

Question 1: There will always be a problem that some persons not be assigned.( I have followed what you said: the slack benefit is lower than all other arc benefits), so how can I solve it? I want to force every person to be assigned!!

Question 2: As mentioned in the first article of the reference paper you provided, one of the conditions for the optimal assignment is : the slack<1/m , but in your program the slack is 10 , why? I can not understand it .

Thank you very much!!!