search

gatagat / lap

Linear Assignment Problem solver (LAPJV/LAPMOD).
BSD 2-Clause "Simplified" License
211 stars 66 forks source link

Reduced costs #12

Open HildebrandoBarros opened 6 years ago

HildebrandoBarros commented 6 years ago

Hi Tomas,

First of all thank you to share this implementation. This had been really useful. One question: Is it possible to access the reduce costs from your implementation?

gatagat commented 6 years ago

This is not implemented at the moment. Having the dual variables u, v would be enough as the reduced_cost_ij = cost_ij - u_i - v_j, but i do not return u, v. Returning v would be a small change but one would also have to explicitly construct u, which is not the case now. If you find a way, let me know.