Maximal Flow Through a Network
1956; Cambridge University Press; Volume: 8; Linguagem: Inglês
10.4153/cjm-1956-045-5
ISSN1496-4279
Autores Tópico(s)Transportation Planning and Optimization
ResumoIntroduction. The problem discussed in this paper was formulated by T. Harris as follows: “Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”
Referência(s)