NETFLOW

Network optimization problems, including minimum cost flow, maximum flow, and matching problems. Also, test problems arising from applications and random problem generators

A wide variety of algorithms is implemented. For minimum cost flow, the simplex algorithm of Kennington and Helgason is available. For maximum flow problems, there are solvers due to Goldberg, Waissi, and Dinic. Algorithms due to Gabow and Micali/Vazirani are available for matching problems.

The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) maintains an ftp site for NETFLOW at dimacs.rutgers.edu. (You can do an anonymous ftp to this address and cd to pub/netflow. Users are advised to browse through this directory (in particular, the files directory.notes and the readme on each subdirectory) for information on algorithms, authors, references, languages, input formats, and so on.

Codes in Fortran, C, and Pascal are present. Most codes utilize the DIMACS standard input/output format. The software is all in the public domain.

Need more info?

Visit the NETFLOW ftp directory or DIMACS, or contact:

DIMACS,
Rutgers, the State University of New Jersey 
P.O. Box 1179 
Piscataway, NJ 08855-1179 
Phone: (908) 932-5928 
Fax: (908) 932-5932 
center@dimacs.rutgers.edu

Reference:

A number of authors are represented by the codes in this collection. The documentation on each subdirectory of the anonympus ftp area contains specific references.

[ Optimization Software Guide | OTC Home Page | NEOS Server | NEOS Guide ]