NETFLO

NETFLO solves linear minimum-cost flow problems and returns to the user information about the optimization problem, the solution process, and the solution. The original NETFLO solver for minimum-cost flow problems was written by R. V. Helgason and J. L. Kennington in 1976. The version of NETFLO used in the NEOS Server was compiled from the UNIX distribution of the solver which is publicly available from DIMACS via anonymous ftp:

ftp://dimacs.rutgers.edu/pub/netflow/mincost/solver-1

Two minor changes were made to the DIMACS version of the solver for inclusion with NEOS:

an increase the size of problems allowed by the solver, and
an increase the objective value precision in an effort to prevent integer overflow for large problems

The NEOS Server interface to NETFLO will accept inputs in either the DIMACS minimum-cost flow format or the NETFLO format. For more information on NETFLO, see pages 244-256 in Algorithms for Network Programming by Kennington and Helgason, John Wiley, 1980.

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.

Using the NEOS Server for NETFLO

To use NETFLO to solve a minimum-cost network flow problem, the user must submit a problem in either the DIMACS standard format or the NETFLO native format. Problems can be submitted through the world wide web (http or ftp URL's) or electronic mail. Enter the location of the DIMACS input file (local file)
DIMACS Input File:

Enter the location of the NETFLO input file (local file)
NETFLO Input File:

Comments:

Put in priority queue

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}