[Lemon-user] Reverse min cost flow

[Arthurus Castus]

Hi everybody,

I'm looking for a smart way to find the max possible flow for a given cost. For now, I do it by running multiple times the NetworkSimplex for every tick of flow until the total cost reaches the wanted value (I could also do it by dichotomy).

Do you know if there are a better way to resolve it ? If not, do you have an idea about how could I re-use structures from the run N-1 to use it in N ?

Many thanks