Skip to main content
SpringerLink
Log in

Common aspects of several network flow algorithms

  • Short Papers
  • Chapter
  • First Online:
Netflow at Pisa

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 26))

  • 91 Accesses

Abstract

This paper reveals some relationships among several algorithms for pure and generalized network flows. These algorithms can be classified as being basic or nonbasic and incremental or nonincremental. The distinction between primal and dual degenerate pivots sheds some light on complexity and degeneracy issues. A detailed presentation of this material is given in Siedersleben (1983).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.I. Ali, R.V. Helgason, J.L. Kennington and H.S. Lall, “Primal simplex network codes: State of the art implementation technology”, Networks 8 (1978) 315–318.

    Article  MathSciNet  Google Scholar 

  2. 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.

    Article  MATH  Google Scholar 

  3. W.H. Cunningham, “A network simplex method”, Mathematical Programming 11 (1976) 105–116.

    Article  MATH  MathSciNet  Google Scholar 

  4. W.H. Cunningham, “Theoretical properties of the network simplex method”, Mathematics of Operations Research 4 (1979), 196–208.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Edmonds and R.M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, Journal of the ACM 19 (1972) 248–264.

    Article  MATH  Google Scholar 

  6. J. Elam, F. Glover and D. Klingman, “A strongly convergent primal simplex algorithm for generalized network flows”, Mathematics of Operations, Research 4, 39–59.

    Google Scholar 

  7. 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.

    Article  MATH  Google Scholar 

  8. F. Glover, D. Karney, D. Klingman and A. Napier, “A computational study on start procedures, basis change criteria and solution algorithms for transportation problems”, Management Science 20 (1974) 793–813.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Hassin, “The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm”, Mathematical Programming 25 (1983) 228–239.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Hultz, D. Klingman and R. Russell, “An advanced dual basic feasible solution for a class of capacitated generalized networks”, Operations Research 24 (1976) 301–313.

    Article  MATH  MathSciNet  Google Scholar 

  11. P.A. Jensen and G. Bhaumik, “A flow augmentation approach to the network with gains minimal cost flow problem”, Manatment Science 23 (1977) 631–644.

    MATH  MathSciNet  Google Scholar 

  12. P.A. Jensen and J.W. Barnes, Network flow programming, (Wiley, New York, 1980).

    MATH  Google Scholar 

  13. W.S. Jewell, “Oprimal flow through networks with gains”, Operations Research 10 (1962) 476–499.

    Article  MATH  MathSciNet  Google Scholar 

  14. J.L. Kennington and R.V. Helgason, Algorithms for network programming (Wiley, New York (1980).

    MATH  Google Scholar 

  15. J.M. Mulvey, “Pivot strategies for primal simplex network codex”, Journal of the ACM 25 (1978) 266–270.

    Article  MATH  MathSciNet  Google Scholar 

  16. J.M. Mulvey, “Testing of large-scale network optimization programs”, Mathematical Programming 15 (1978) 291–314.

    Article  MATH  MathSciNet  Google Scholar 

  17. C.H. Papadimitriou and K. Steiglitz, Combinatorial, optimization. Algorithms and complexity (Prentice Hall, Englewood Cliffs, NJ, 1982).

    MATH  Google Scholar 

  18. S.R. Schmidt, P.A. Jensen and J.W. Barnes, “An Advanced Dual Incremental Network Algorithm”, Networks 12 (1982) 475–492.

    Article  MathSciNet  Google Scholar 

  19. J. Siedersleben, “Common aspects of several network flow algorithms” (unpublished manuscript 1983).

    Google Scholar 

  20. J.F. Shapiro, “A note on the primal-dual and out-of-kilter algorithms for network optimizations problems”, Networks 7 (1977) 81–88.

    Article  MATH  Google Scholar 

  21. K. Truemper, “An efficient scaling procedure for gain networks”, Networks 6 (1976) 151–159.

    Article  MATH  MathSciNet  Google Scholar 

  22. N. Zadeh, “Near-equivalence of network flow algorithms”, Technical Report 26, Department of Operations Research, Stanford University (Stanford, CA, 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. sd & m GmbH, Führichstr. 70, D8000, München 80, FR of Germany

    Johannes Siedersleben

Authors
  1. Johannes Siedersleben
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Gallo Claudio Sandi

Rights and permissions

Reprints and permissions

Copyright information

© 1986 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Siedersleben, J. (1986). Common aspects of several network flow algorithms. In: Gallo, G., Sandi, C. (eds) Netflow at Pisa. Mathematical Programming Studies, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121095

Download citation

  • DOI: https://doi.org/10.1007/BFb0121095

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00922-8

  • Online ISBN: 978-3-642-00923-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation