论文信息 - A fuzzy max-flow min-cut theorem

A fuzzy max-flow min-cut theorem

Interval-valued versions of the max-flow min-cut theorem and Karp-Edmonds algorithm are developed and provide robustness estimates for flows in networks in an imprecise or uncertain environment. These results are extended to networks with fuzzy capacities and flows. (C) 2001 Elsevier Science B.V. All rights reserved.

Phil Diamond | P. Diamond

[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .

[2] Willard L. Miranker,et al. Computer arithmetic in theory and practice , 1981, Computer science and applied mathematics.

[3] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[4] Shimon Even,et al. Graph Algorithms , 1979 .

[5] Gary Chartrand,et al. Applied and algorithmic graph theory , 1992 .

[6] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7] D. Dubois,et al. Operations on fuzzy numbers , 1978 .

[8] Siegfried Gottwald,et al. Applications of Fuzzy Sets to Systems Analysis , 1975 .

[9] Vincenzo Cutello,et al. Flow networks and fuzzy-state systems , 1996 .