The maximum flow in a time-varying network
Publication in refereed journal
CUHK Authors
Full Text
There are no full text file(s) associated with this record. |
Other information
AbstractThe classical maximum flow problem is to send flow from the source to the sink as much as possible. The problem is static, in that are capacity is a constant. Max-flow min-cut theorem of Fold and Fulkerson [1] is a fundamental result which reveals the relationship between the maximum flow and the minimum cut in a static network. It has played an important role not only in investigating the classical maximum flow problem, but also in developing graph theory, since many results could be regarded as its corollaries.
All Author(s) ListSha D, Cai X, Wong CK
Name of Conference9th Belgian-French-German Conference on Optimization
Start Date of Conference07/09/1988
End Date of Conference11/09/1998
Place of ConferenceNAMUR
Journal nameLecture Notes in Economics and Mathematical Systems
Year2000
Month1
Day1
Volume Number48
PublisherSPRINGER-VERLAG BERLIN
Pages437 - 456
ISBN3-540-66905-1
ISSN0075-8442
LanguagesEnglish-United Kingdom
Keywordsmaximum flow; time-varying network
Web of Science Subject CategoriesBusiness & Economics; Economics; Mathematical Methods In Social Sciences; Mathematics; Mathematics, Interdisciplinary Applications; Social Sciences, Mathematical Methods
