An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions

Authors

Jeffrey L. Arthur, Oregon State University
James O. Frendewey, Michigan Technological University

Document Type

Article

Publication Date

1-1-1994

Department

College of Business

Abstract

A new algorithm for generating structured, minimum cost network flow problems (transshipment, transportation, assignment, and shortest path) with known optimal solutions is described. The procedure is based on developing problems around an optimal basis so that the characteristics of solutions can be controlled. Computational tests show that the problems generated are as difficult to solve as are those produced by the commonly used generator NETGEN, while allowing the user a much greater degree of control over the resulting problems.

Publisher's Statement

Copyright © 1994 Wiley Periodicals, Inc., A Wiley Company. Publisher’s version of record: https://doi.org/10.1002/net.3230240805

Publication Title

Networks

Recommended Citation

Arthur, J., & Frendewey, J. (1994). An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions. Networks, 24(8), 445-454. http://doi.org/10.1002/net.3230240805
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3795