MCFSimplex is our freshly-developed implementation of the primal and dual network simplex algorithm for MCF problems. Its strong points are: can also solve (although not very effectively) Quadratic separable MCFs; it is entirely open-source under the flexible LGPL license, and therefore can be used with little restriction in all environments. It is also reasonably efficient when compared to most other available network simplex codes.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Kovács, Péter: Minimum-cost flow algorithms: an experimental evaluation (2015)