Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN ALGORITHM FOR MINIMAL DYNAMIC FLOW

  • Published : 2000.05.01

⟨ Previous Next ⟩

Abstract

FORD and FULKERSON have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optimal dynamic flow. this paper presents the remark that temporally repeated flows may be not optimal for a minimal dynamic flow and an algorithm for such a flow. a numerical example is presented.

Keywords

References

  1. Network Flows, Theory, Algorithms and Applications R.K. Ahuja;T.L. Magnati;J. B. Orlin
  2. RAIRO v.Vert 3 Deux remarques sur le flot dynamic maximal de cout minimal E. Ciurea, E.
  3. Cahiers du CERO v.26 no.1-2 Les problems des flots dynamiques E. Ciurea
  4. Libertas Mathematica v.ⅩⅦ Counterexamples in maximal dynamic flows E. Ciurea
  5. Flow in Networks D.R. Fulkerson;L. R. Ford
  6. Networks and Alghorithms Graphs D. Jungnickel
  7. Network Programing K. G. Murty
  8. Opns.Res. v.19 no.7 An Algorithm for universal maximal dynamic flows in a network W. C. Wilkinson