An efficient implementation of the network simplex method

  • M. D. Grigoriadis
Chapter
First Online:
Received:
Revised:
Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 26)

Abstract

This paper describes an efficient implementation of the network simplex method for solving large sparse minimum-cost network flow problems. This is a single-phase implementation which employs an initial spanning tree of all artificial edges, a gradual penalty method for reducing infeasibilities and a sample pricing strategy which does not require adjacency-ordered edge lists. Data structures, algorithmic details and computational experience with a set of generated problems are presented. For the problems tested, the present implementation is found to be more efficient than other available implementations of the network simplex and primal-dual methods.

Key words

Minimum-Cost Network Flows Network Simplex Method Linear Programming Basic Solutions 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H.A. Aashtiani and T.L. Magnanti, “Implementing primal-dual network flow algorithms”, ORC Report 055-76, M.I.T. (Cambridge, MA, 1976).Google Scholar
  2. [2]
    R. Barr, F. Glover and D. Klingman, “An improved version of the out-of-kilter method and a comparative study of computer codes”, Mathematical Programming 7 (1974) 60–86.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    D.P. Bertsekas, “A unified framework for minimum cost network flow problems”, Technical Report LIDS-P-1245-A, M.I.T. (Cambridge, MA, 1982).Google Scholar
  4. [4]
    D.P. Bertsekas and P. Tseng, “Relaxation methods for minimum cost network flow problems”, Technical Report LIDS-P-1339, M.I.T. (Cambridge, MA, 1983).Google Scholar
  5. [5]
    R.G. Bland, “New finite pivoting rules for the simplex method”, Mathematics of Operations Research 2 (1977) 103–107.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    R.G. Bland and D.L. Jensen, private communication (1982). Also see D.L. Jensen, “Combinatorial augmentation methods: coloring and duality”, Ph.D. Thesis, School of OR and IE, Cornell University (Ithaca, NY, 1985).Google Scholar
  7. [7]
    G.H. Bradley, G.G. Brown and G.W. Graves, “Design and implementation of large scale primal transshipment algorithms”, Management Science 24 (1977) 1–34.MATHCrossRefGoogle Scholar
  8. [8]
    R.G. Busacker and P.J. Gowen, “A procedure for determining a family of minimal cost network flow patterns”, ORO Technical Report 15, Operations Research Office, Johns Hopkins University (Baltimore, MD, 1961).Google Scholar
  9. [9]
    A. Charnes, D. Karney, D. Klingman and J. Stutz, “Past, present and future of large scale transshipment computer codes and applications”, Computers and Operations Research 2 (1975) 71–81.CrossRefGoogle Scholar
  10. [10]
    W.H. Cunningham, “A network simplex method”, Mathematical Programming 1 (1976) 105–116.CrossRefMathSciNetGoogle Scholar
  11. [11]
    W.H. Cunningham, “Theoretical properties of the network simplex methods”, Mathematics of Operations Research 4 (1979) 196–208.MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    G.B. Dantzig, “Application of the simplex method to a transportation problem”, in: T.C. Koopmans, ed., Activity analysis of production and allocation (Wiley, New York, 1951) pp. 359–373.Google Scholar
  13. [13]
    G.B. Dantzig, “Upper bounds, secondary constraints and block triangularity in linear programming”, Econometrica 23 (1955) 174–183.MATHCrossRefMathSciNetGoogle Scholar
  14. [41]
    V. Malhotra, M. Kumar and S. Maheshwari, “An O(|V|3) algorithm for finding maximum flows inGoogle Scholar
  15. [15]
    DECSYSTEM-10/DECSYSTEM-20 processor reference manual, Publication AD-H391A-T1 (Digital Equipment Corporation, Marlboro, MA, June 1982) pp. 3.56–58. Also see “METER%” in TOPS-20 monitor calls reference manual, Publication AA-4166E-T1 (Digital Equipment corporation, Marlboro, MA, December 1982) pp. 3.20.Google Scholar
  16. [16]
    E.A. Dinic, “Algorithm for solution of a problem of maximum flow in network with power estimation”, Soviet Mathematics Doklady 11 (1970) 1277–1280.Google Scholar
  17. [17]
    J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the ACM 19 (1972) 248–264.MATHCrossRefGoogle Scholar
  18. [18]
    J. Edmonds and D.L. Jensen, private communication (1982).Google Scholar
  19. [19]
    D.R. Fulkerson and G.B. Dantzig, “Computations of maximal flows in networks”, Naval Research Logistics Quarterly 2 (1955) 277–283.CrossRefMathSciNetGoogle Scholar
  20. [20]
    D.R. Fulkerson, “An out-of-kilter method for minimal-cost flow problems”, SIAM Journal on Applied Mathematics 9 (1961) 18–27.MATHCrossRefGoogle Scholar
  21. [21]
    B.J. Gassner, “Cycling in the transportation problem”, Naval Research Logisics Quarterly 11 (1964) 43–58.MATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    S.I. Gass, Linear programming—Methods and applications (McGraw-Hill, New York, 1975).MATHGoogle Scholar
  23. [23]
    F. Glover, D. Karney and D. Klingman, “Implementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems”, Networks 4 (1974) 191–212.MATHCrossRefGoogle Scholar
  24. [24]
    F. Glover, D. Karney, D. Klingman and A. Napier, “A comparison of computational times for various starting procedures, basis change criteria and solution algorithms for transportation problems”, Management Science 20 (1974) 793–819.MATHCrossRefMathSciNetGoogle Scholar
  25. [25]
    D. Goldfarb and J.K. Reid, “A practicable steepest edge simplex algorithm”, Mathematical Programming 12 (1977) 361–371.MATHCrossRefMathSciNetGoogle Scholar
  26. [26]
    D. Goldfarb, “Steepest edge simplex algorithms for network flow problems”, Technical Report RC 6649, IBM T.J. Watson Research Center (Yorktown Heights, NY, 1977).Google Scholar
  27. [27]
    D. Goldfarb and M.D. Grigoriadis, “An efficient steepest-edge algorithm for maximum flow problems”, Tenth International Symposium on Mathematical Programming, Montreal, Canada (1979).Google Scholar
  28. [28]
    M.D. Grigoriadis, “Minimum cost multistage multicommodity network flows”, NATO Conference on Applications of Optimization Methods for Large-scale Resource Allocation Problems, Elsinore, Denmark (July 1971).Google Scholar
  29. [29]
    M.D. Grigoriadis, “Algorithms for the minimum cost single and multicommodity network flow problems”, Lecture notes, Summer course in Combinatorial Optimization, SOGESTA, Urbino, Italy (1978).Google Scholar
  30. [30]
    M.D. Grigoriadis and T. Hsu, “The Rutgers minimum cost network flow subroutines”, SIGMAP Bulletin of the ACM 26 (1979) 17–18.Google Scholar
  31. [31]
    E. Horowitz and S.J. Sahni, Fundamentals of computer algorithms (Computer Science Press, Rockville, MD, 1978).MATHGoogle Scholar
  32. [32]
    P.A. Jensen and J.W. Barnes, Network flow programming (Wiley, New York, 1980).MATHGoogle Scholar
  33. [33]
    E.L. Johnson, “Networks and basic solutions”, Operations Research 14 (1966) 619–623.CrossRefGoogle Scholar
  34. [34]
    C.L. Hedrick, “Fortran-X: An extended memory version of the DECSYSTEM-20 Fortran Version 7”, unpublished LCSR Report, Rutgers University (New Brunswick, NJ, November 1983).Google Scholar
  35. [35]
    D. Karney and D. Klingman, “Implementation and computational study on an in-core out-of-core primal network code”, Operations Research 24 (1976) 1056–1077.CrossRefGoogle Scholar
  36. [36]
    J.L. Kennington and R.V. Helgason, Algorithms for network programming (Wiley, New York, 1980).MATHGoogle Scholar
  37. [37]
    M. Klein, “A primal method for minimal cost flows”, Management Science 14 (1967) 205–220.MATHCrossRefGoogle Scholar
  38. [38]
    D. Klingman, A. Napier and J. Stutz, “NETGEN—A program for generating large-scale (un)capacitated assignment, transportation and minimum cost flow network problems”, Management Science 20 (1974) 814–821.MATHCrossRefMathSciNetGoogle Scholar
  39. [39]
    D.E. Knuth, The art of computer programming—Volume 1 (Addison-Wesley, Reading, MA, 1973).Google Scholar
  40. [40]
    E.L. Lawler, Combinatorial optimization: Networks and matroids (Holt, Rinehart and Winston, New York, 1976).MATHGoogle Scholar
  41. [41]
    V. Malhotra, M. Kumar and S. Maheshwari, “An O(|V|3) algorithm for finding maximum flows in networks”, Information Processing Letters 7 (1978) 277–278.MATHCrossRefMathSciNetGoogle Scholar
  42. [42]
    J. Mulvey, “Testing a large-scale network optimization program”, Mathematical Programming 15 (1978) 291–314.MATHCrossRefMathSciNetGoogle Scholar
  43. [43]
    J. Mulvey, “Pivot strategies for primal-simplex network codes”, Journal of the ACM 25 (1978) 266–270.MATHCrossRefMathSciNetGoogle Scholar
  44. [44]
    A. Orden, “The transshipment problem”, Management Science 2 (1956) 276–285.MATHCrossRefMathSciNetGoogle Scholar
  45. [45]
    J.B. Orlin, “Polynomial time pivoting procedures for minimum cost network flow problems”, TIMS/ORSA National Meeting, San Francisco, CA, 17 May 1984. Also see “On the simplex algorithm for networks”, Sloan W.P. 1467–1483 (rev. May 1984), M.I.T., Cambridge, MA.Google Scholar
  46. [46]
    H. Rock, “Scaling techniques for minimal cost network flows”, in: U. Page, ed., Discrete structures and algorithms (Carl Hanser, Munchen, 1980) pp. 181–191.Google Scholar
  47. [47]
    V. Srinivasan and G.L. Thompson, “Accelerated algorithms for labeling and relabeling trees, with applications to distribution problems”, Journal of the ACM 19 (1972) 712–726.MATHCrossRefGoogle Scholar
  48. [48]
    E. Tardos, “A strongly polynomial minimum cost circulation algorithm”, Combinatorica (to appear May 1985).Google Scholar
  49. [49]
    N. Zadeh, “A bad network problem for the simplex method and other minimum cost flow algorithms”, Mathematical Programming 5 (1973) 255–266.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1986

Authors and Affiliations

  • M. D. Grigoriadis
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Personalised recommendations