Miscellaneous Network Optimization Codes

bertsekas.tar.Z
     Collection of network optimization (FORTRAN) codes by D. P. Bertsekas,
     contains solvers for shortest paths, symmetric assignment, maximum flow,
     and minimum cost flow problems, see author's article Auction Algorithms for
     Network Flow Problems: A Tutorial Introduction, Computational Optimization
     and Applications, Vol. 1 (1992), pp. 7-26, also available by the COAP library
     (B. Hager)

 info  - General information on program and description of input data format

mmc.tar.Z
     Code for determining a minimum mean cycle in a directed graph, see
     N. E. Young, R. E. Tarjan, J. B. Orlin: Faster Parametric Shortest Path and
     Minimum-Balance Algorithms, Networks 21 (1991), 205-221, implementation
     by G. Skorobohatyj (ZIB)

 info  -  General information on program, description of input data format, and
           some test results

Concorde
     Combinatatorial Optimization and Networked Combinatorial Optimization
     Research and Development Environment, a code for solving Traveling
     Salesman and related network optimization problems by D. Applegate,
     R. Bixby, V. Chvátal, and E. Cook, also see author's TSP Web page for
     information on benchmarks and papers

E. Martins's Personal Homepage
     Public domain codes for solving shortest path, k-shortest paths and other
     network optimization problems developed at the Mathematics Department
     of the University of Coimbra.

A.V. Goldberg's Netopt Codes
     Network optimization codes by A.V. Goldberg et. al. for shortest paths
     (SPLIB, HQ), assignment (CSA), minimum cost (CS2), maximum flow (PRF),
     and minimum cut (PRF, MINCUTLIB) problems (access to codes restricted)