New answers tagged

2 votes

How do you recover dual variables for a minimum weight bipartite perfect matching problem?

If we assume that $y$ corresponds to the constraints $\sum_i x_{ij}=1$ and $z$ corresponds to the other set of constraints, then you have a $(2n)\times (2n)$ system of equations $$y_j + z_i = c_{ij}$$ ...
  • 32k

Top 50 recent answers are included