Second best temporally repeated flows

Authors:
Eleonor Ciurea
Affiliations:
Department of Computer Science, Transilvania University, 50, Iuliu Maniu 2200 Braşov, Romania
Venue:
The Korean Journal of Computational & Applied Mathematics
Year:
2002

Citing 3
Cited 0

Network programming

Network programming
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Graphs, Networks and Algorithms

Graphs, Networks and Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 an algorithm for second best temporally repeated flows. A numerical example is presented.