Maximum flow in a network with fuzzy arc capacities

DOI10.1016/0165-0114(82)90006-9zbMath0489.90040MaRDI QIDQ1167060

Stefan Chanas, Waldemar Kołodziejczyk

Publication date: 1982

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-0114(82)90006-9

zbMATH Keywords

algorithm; minimum cut; fuzzy goals; fuzzy arc capacities; maximal network flow

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

03E72: Theory of fuzzy sets, etc.

94D05: Fuzzy sets and logic (in connection with information, communication, or circuits theory)

Related Items

A generalized bi-criteria fuzzy integer flow sharing problem, Real-valued flows in a network with fuzzy arc capacities, Fuzzy shortest paths, Modeling uncertainty in networks, The fuzzy shortest path problem and its most vital arcs, Fuzzy optimal flow on imprecise structures, Fuzzy decision networks and deconvolution, Applications of fuzzy chaos to fuzzy simulation, A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Fuzzy programming and linear programming with several objective functions
• Sensitivity analysis in fuzzy linear programming
• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Decision-Making in a Fuzzy Environment