[Lemon-user] equality form of min-cost network flow

[Matthew Galati]

In the documentation for min-cost network flow, it states:
  "However if the sum of the supply values is zero, then these two problems
are equivalent. The
algorithms<http://lemon.cs.elte.hu/pub/doc/latest/a00531.html>in LEMON
support the general form, so if you need the equality form, you
have to ensure this additional contraint manually."

http://lemon.cs.elte.hu/pub/doc/latest/min_cost_flow.html

What is the best way to do this? Say, you have a set of flow-balance
constraints that are all >=. But, for one node / row, you want to ensure
equality. Let's also assume that sum{ i} supply[i] != 0. That is, the = and
>= are not equivalent. This equality is "another constraint". How do you go
about ensuring this constraint manually? as suggested in the documentation.
Is there any way to adjust the input graph to ensure this? Or change
something in the algorithm to identify one constraint or the other as = vs
>=0?

Thanks,
Matt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20100422/75be4429/attachment.html>