Clearly, there is an edge with tuple (1 − p(i, j), 1) between each entity end mention indicating that each entity could map into any mention while with different probabilities.
solving this Cost-Flow problem is equal to maximizing the equation 1 with two constraints.