MCF is an implementation of a primal and a dual network simplex algorithm. MCF has been tested with several classes of articially generated NETGEN problems and with real-world problems arising from vehicle scheduling and telecommunication problems.
Our computational experiments have always shown a good polynomial behaviour of our code. Even truly large-scale real-world instances with several thousand nodes and several million arcs can be solved quickly. The code was checked with Purify making this implementation quite reliable and robust.
Get MCF and take it for a test drive to fully assess its capabilities!
What's New in This Release: [ read full changelog ]
· New directory structure.
· Bug fix in dual solver, file dbla.c: removed possible arithmetic overflow, which may lead to incorrect results.
