Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A new strongly polynomial dual network simplex algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m +n logn) logn) time for the network withn nodes andm arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos’ (1993) dual network simplex algorithm by a factor ofm/n.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993).

    Google Scholar 

  2. R.D. Armstrong and Z. Jin. Solving linear bottleneck assignment problems via strong spanning trees,Operations Research Letters 12 (1992) 179–180.

    Article  MATH  MathSciNet  Google Scholar 

  3. R.D. Armstrong and Z. Jin, Strongly polynomial simplex method for bipartite vertex packing,Discrete Applied Mathematics 64 (1996) 97–103.

    Article  MATH  MathSciNet  Google Scholar 

  4. M.L. Balinski, A competitive (dual) simplex method for the assignment problem,Mathematical Programming 34 (1986) 125–141.

    Article  MATH  MathSciNet  Google Scholar 

  5. M.L. Balinski and J. Gonzalez, Maximum matching in bipartite graphs via strong spanning trees,Networks 21 (1991) 165–179.

    MATH  MathSciNet  Google Scholar 

  6. W. Cunningham, A network simplex method,Mathematical Programming 11 (1976) 105–116.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. D. Goldfarb, Efficient dual simplex algorithms for the assignment problem,Mathematical Programming 33 (1985) 187–203.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm,Operations Research 41 (1993) 338–350.

    Article  MATH  MathSciNet  Google Scholar 

  10. J.B. Orlin, S.A. Plotkin and E. Tardos, Polynomial dual network simplex algorithms,Mathematical Programming 60 (1993) 255–276.

    Article  MathSciNet  Google Scholar 

  11. E. Tardos, A strongly polynomial minimum cost circulation algorithm,Combinatorica 5 (1985) 247–255.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Zhiying Jin

    Present address: Department of Industrial Engineering and Operations Research, Columbia University, 10027, New York, NY, USA

Authors and Affiliations

  1. Graduate School of Management and RUTCOR — Rutgers Center for Operations Research, Rutgers University, 07102, Newark, NJ, USA

    Ronald D. Armstrong & Zhiying Jin

Authors
  1. Ronald D. Armstrong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiying Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Armstrong, R.D., Jin, Z. A new strongly polynomial dual network simplex algorithm. Mathematical Programming 78, 131–148 (1997). https://doi.org/10.1007/BF02614366

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation