Journal of applied mathematics & informatics

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

SECOND BEST TEMPORALLY REPEATED FLOWS

  • Eleonor, Ciurea (Department of Computer Science, Transilvania University)
  • Published : 2002.12.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 optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

Keywords

References

  1. Theory, algorithms and applications Network Flows Ahuja,R.K.;Magnanti,T.L.;Orlin,J.B.
  2. RAIRO, Vert 3 Deux remarques sur le flot dynamic maximal de cout minimal Ciurea,E.
  3. Cahiers du CERO v.26 no.1;2 Les problem des flots dynamiques Ciurea,E.
  4. Libertas Mathematica v.XVII Counterexamples in maximal dynamic flows Ciurea,E.
  5. Flow in Networks Ford,L.R.Jr.;Fulkerson,D.R.
  6. Beitrage zur angewandten Analysis and Informatik Ranking approach to max-ordering combinatorial optimization and network flows Hamacher,H.W.;Husselman,C.
  7. Graphs, Networks and Alghorithms Jungnickel,D.
  8. Network Programming Murty,K.G.
  9. Opns. Res. v.19 no.7 An algorithm for universal maximal dynamic flows in a network Wilkinson,W.C.