RELAX4 solves linear minimum-cost flow problems and returns to the user information about the optimization problem, the solution process, and the solution. The original RELAX4 solver for minimum-cost flow problems was written by Dimitri Bertsekas (Massachusetts Institute of Technology) and Paul Tseng (University of Washington).
The RELAX4 code is publicly available via:
http://web.mit.edu/dimitrib/www/RELAX4.txt
The code can be used for any non-commercial research purposes and for comparative test purposes, but cannot be used to satisfy commercial deliverables to government or industry without prior agreement with the authors.
Both authors welcome and appreciate feedback from users of their code. They may be contacted by e-mail:
Dimitri Bertsekas: bertsekas@lids.mit.edu Paul Tseng: tseng@math.washington.edu
To learn more about linear network optimization, click the "Background" link to the NEOS Guide.
To take this part of the server for a trial run by submitting a ready-made problem, click on the "Trial Run" link above.
Problems can be submitted through the world wide web (http or ftp URLs) or electronic mail.
Enter the location of the RELAX4 Input file RELAX4 File:
DOE disclaimer DOE Web privacy policy