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

[Matthew Galati]

> The first and maybe the fastest option is to contribute such an
> extension by yourself. We are more than happy to accept such a patch,
> and will help in all possible way to prepare it, of course.
>
> If you can't do that, you/we can still persuade Peter (the main
> developer of the NS code) to implement this feature. I guess this is
> also a pretty viable option...
>
> Anyway, I created a ticket about this enhancement in the issue tracker,
> see http://lemon.cs.elte.hu/trac/lemon/ticket/375
>


This would be great!

I was - at first - thinking about the original request, where one can have a
mix of EQ, GEQ, LEQ. It seems the code already handles this internally but
is missing the API to accept it. Although I am not all that familiar with
the data structures used - so I am not sure if it is that simple.

The feature to accept lower and upper bounds for rows (flow balance) would
be great also - but it sounds like is more complicated to implement.

I am not sure if would be able to contribute myself - as I am not that
confident in understanding the internal data structures used. But, I suppose
I can try - if no one else plans to do it.

Thanks!
Matt
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20100701/247080f1/attachment.html>