A fuzzy max-flow min-cut theorem
| Contribuinte(s) |
D. Dubois H. Prade |
|---|---|
| Data(s) |
01/01/2001
|
| Resumo |
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. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Elsevier |
| Palavras-Chave | #Computer Science, Theory & Methods #Mathematics, Applied #Statistics & Probability #Network Flows #Max-flow Min-cut #Fuzzy Flows #C1 #230119 Systems Theory and Control #780101 Mathematical sciences |
| Tipo |
Journal Article |
