MCF MCF is an implementation of a primal and a dual network simplex algorithm. MCF has been tested with several classes of artificially generated NETGEN problems and with real-world problems arising from vehicle scheduling and telecommunication problems. Computational experiments have always shown a good polynomial behavior of the MCF code. Even truly large-scale real-world test instances with several thousand nodes and several million arcs can be solved quickly.

Current Version:   1.1 License Type:   Free for Non-Commercial and Academic Use, Registration required (ZIB Academic License conditions)

Home Site: http://www.zib.de/Optimization/Software/Mcf/ Source Code Availability: Yes Available Binary Packages: Debian Package: No RedHat RPM Package: No Other Packages: No Targeted Platforms: Unix (including Linux) Software/Hardware Requirements: None

Other Links: http://www.zib.de/loebel/ Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization