Network Optimization Codes
Several high performance codes for such network optimization problems as matching, shortest paths,
and network flow, developed by Andrew Goldberg and his collaborators.
The software includes
- SPLIB: codes, generators, and generator inputs for shortest path algorithms.
- CSA: efficient implementation of a scaling push-relabel algorithm for the assignment problem.
- CS2: efficient implementation of a scaling push-relabel algorithm for the minimum-cost
flow/transportation problems.
- PRF: efficient implementations the push-relabel method for the maximum flow/minimum cut
problems.
- HQ: implementations of Dijkstra's shortest path algorithm based on hot queue, multi-level
buckets, and k-heap data structures, as well as problem generators.
- MINCUTLIB: codes and data sets for the minimum cut problem.
|
Current Version: N/A
License Type: Free for Non-Commercial Use. Commercial use of
some packages requires a licence. See Home Site for more detail.
|
Home Site:
http://www.intertrust.com/star/goldberg/soft.html
Source Code Availability:
Yes
Available Binary Packages:
- Debian Package: No
- RedHat RPM Package: No
- Other Packages: No
Targeted Platforms:
It works under several version of UNIX including LINUX.
In fact a big part of it was developed under LINUX.
Software/Hardware Requirements:
some codes need a C compiler while other codes need
a C++ compiler.
|
Other Links:
http://www.star-lab.com/goldberg/soft.html
Mailing Lists/USENET News Groups:
None
User Comments:
See A Screen Shot? (Not Yet)
|