An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
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. © 1994 by John Wiley & Sons, Inc. Copyright © 1994 Wiley Periodicals, Inc., A Wiley Company
An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3795