|Name of the Package||Author(s)||Purpose|
|GENOS 1.0||John Mulvey
Stavros A. Zenios
The Wharton School,
University of Pennsylvania.
|Nonlinear optimization for problems with network and generalized network constraints.
The algorithms in GENOS 1.0 include network simplex, primal truncated Newton, and simplicial decomposition.
|GIDEN||Collette R. Coullard, Northwestern University
David S. Dilworth, Systems Research
Jonathan H. Owen, Northwestern University
|GIDEN is an interactive software environment designed to facilitate the visualization of network optimization problems, solutions, and algorithms..|
|LNOS||Dimitri P. Bertsekas
Massachusetts Institute of Technology
|The classical linear programming/network flow problems: shortest path, maximum flow, assignment, minimum cost flow.|
|MCF||Andreas M. Löbel, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)||MCF is a network simplex implementation.|
Rutgers, the State University of New Jersey
P.O. Box 1179
Piscataway, NJ 08855-1179
Phone: (908) 932-5928
Fax: (908) 932-5932
|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.
|PROC NETFLOW||SAS Institute Research & Development
SAS Institute Inc.
SAS Campus Drive
Cary, NC 27513
Phone: (919) 677-8000
Fax: (919) 677-4444
|The NETFLOW procedure finds the shortest path, the maximum flow, or the minimum cost flow through a network.|
|TSA88||Eastern software products
P. O. Box 15328
Alexandria, VA 22309
Phone: (703) 360-7600
Fax: (703) 360-7654
|TSA88 (Transportation Simplex Algorithm) is a general purpose system for solving transportation problems with up to 1300 sources (origins or supply points) and sinks (destination od demand points).
TSA88 finds a minimum-cost plan for shipments from the sources do not exceed supplies and shipments to the sinks meet demands.