[Lemon-user] MCF Optimal Assignment problem

[T.A. Heba Essam]

Dears,


I have a scientific question more than a technical one. I need to get an optimal assignment when the number of source nodes is greater than the number of destination nodes. I'm currently using MCF solver, it gets me an optimal solution when the number of source and destination nodes is equal. Otherwise, it might not be optimal.


Is there something I should handle? or I should be using another algorithm to solve this problem?


Please find attachment for more clarification. It illustrates an example which I encountered while testing.


Thanks,

Heba

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20140520/83d74e8e/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: Illustration.docx
Type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
Size: 53992 bytes
Desc: Illustration.docx
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20140520/83d74e8e/attachment-0001.docx>