Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://www.sai.msu.su/sal/B/3/MCF.html
Дата изменения: Unknown Дата индексирования: Sat Dec 22 05:49:44 2007 Кодировка: |
![]() |
![]() |
![]() |
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:
Source Code Availability:
Available Binary Packages:
Targeted Platforms: Software/Hardware Requirements:
|
Other Links:
Mailing Lists/USENET News Groups: User Comments:
See A Screen Shot? (Not Yet)
|