COIN-OR::LEMON - Graph Library

Changes between Initial Version and Version 1 of Ticket #509, comment 2


Ignore:
Timestamp:
09/01/14 17:55:06 (5 years ago)
Author:
Peter Kovacs
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #509, comment 2

    initial v1  
    1 Could you try solving the two versions of the problem with another min-cost flow algorithm provided by LEMON? I think !CapacityScaling should be the most accurate in case of non-integer costs, but it can be significantly slower than !NetworkSimplex. They have (almost) the same interface, so you can easily switch between them.
     1You can also try another min-cost flow algorithm provided by LEMON. !CapacityScaling should be the most stable and accurate in case of non-integer costs. Moreover, please note that the other algorithms actually does not support non-integer data. (They may handle them correctly, but it is not guaranteed.) See the warnings in their API documentation:
     2http://lemon.cs.elte.hu/pub/doc/1.3/a00269.html
     3http://lemon.cs.elte.hu/pub/doc/1.3/a00067.html
     4
     5However, !CapacityScaling can be significantly slower than !NetworkSimplex.
     6
     7