Second best temporally repeated flows |
| |
| Authors: | Eleonor Ciurea |
| |
| Affiliation: | 1. Department of Computer Science, Transilvania University, 50, Iuliu Maniu, 2200, Bra?ov, Romania
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
