[Lemon-user] Multicommodity flows (was: Capacity on the nodes)

[Kovács Péter]

Hi All,

LEMON does not provide multicommodity flow algorithms currently. 
However, a few implementations were written some years ago. The codes 
are not mature and polished enough, that is why they are still not part 
of the public releases of the LEMON library. However, they should be 
correct and efficient, and are fully conform to the concepts of the 
library.

You can find the codes in this repository:
http://lime.cs.elte.hu/~kpeter/hgwebdir.cgi/lemon-multicommodity

These two files contain the implementations:
http://lime.cs.elte.hu/~kpeter/hgwebdir.cgi/lemon-multicommodity/file/tip/lemon/multicommodity_flow.h
http://lime.cs.elte.hu/~kpeter/hgwebdir.cgi/lemon-multicommodity/file/tip/lemon/concurrent_flow.h

Feel free to use them. Any feedback is welcome.

Regards,
Péter





> Hello Mariam,
>
> a common approach on node capacities is simply to transform the graph.
> You can split the node into two nodes and an arc with cost = 0 and put
> the capacity on the new arc between the two nodes.
>
> But I'm interested in the multicommodity cost flow Problem. Do plan to
> implement a solver for this problem in lemon?
>
> Greetings,
> Johannes
>
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>