Skip to main content
SpringerLink
Log in

An efficient P-D algorithm for shortest path problem

  • Study Bulletin
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin. Network Flows. In G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd ed., Handbooks in Operations Research and Management Science, Vol. 1, Optimization Elsevier Science Publisher B.V., 1989, 211–369.

  2. R.E. Tarjan. Data Structure and Algorithms.SIAM, Philadelphia, PA, 1983.

    Google Scholar 

  3. E. Dijkstra. A Note on Two Problems in Connection with Graph.Numerische Mathematics, 1959, 1: 269–271.

    Google Scholar 

  4. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Printice-Hall, Englewood Cliff, NJ, 1982.

    Google Scholar 

  5. H.W. Kuhn. The Hungarian Method for the Assignment Problem.Naval Res. Log. Quat., 1955, 2: 83–97.

    Google Scholar 

  6. G.B. Dantzig, L.R. Ford and D.R. Fulkerson. A Primal-Dual Algorithm for Linear Programs. In H.W. Kuhn and A.W. Tucker ed., Linear Inequalities and Related Systems, Annals of Mathematics Study, No. 38, Princeton University Press, Princeton, NJ, 1956, 171–181.

    Google Scholar 

  7. C.E. Yang and D.Y. Jin. A Primal-Dual Algorithm for the Minimum Average Weighted Length Circuit Problem.Networks, 1991, 21: 705–712.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Changsha Railway Institute, 410075, Changsha, China

    Yang Cheng'en & Liang Shuli

Authors
  1. Yang Cheng'en
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Shuli
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported by the National Natural Science Foundation of China under Grant 19271023.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, C., Liang, S. An efficient P-D algorithm for shortest path problem. Acta Mathematicae Applicatae Sinica 13, 221–224 (1997). https://doi.org/10.1007/BF02015143

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation