[Lemon-user] integer minimum cost network flow

[Kovács Péter]

Hi Leandro,

LEMON can solve minimum cost network flow problems, but only in case of 
linear cost functions. The integrality of the flow values are ensured. 
LEMON provides multiple algorithms for this purpose, see the related 
documentation here:
http://lemon.cs.elte.hu/pub/doc/1.3/a00607.html

The link you sent considers separable convex cost objective function, 
which is not supported in LEMON yet. Is this problem what you are 
actually looking for?

Best regards,
Peter


On 2014.01.14. 3:05, Leandro C. Coelho wrote:
> Dear list,
>
> Can Lemon solve integer minimum cost network flow problems? (
> http://link.springer.com/chapter/10.1007%2FBFb0121104 )
>
> Basically, I want to solve a MCNF in which I want to ensure that flows
> are integer. I can scale the supplies to be binaries, if needed.
>
> Thanks
>