Maximum flow in a network with fuzzy arc capacities

DOI10.1016/0165-0114(82)90006-9zbMath0489.90040OpenAlexW2014042800MaRDI 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

algorithmminimum cutfuzzy goalsfuzzy arc capacitiesmaximal network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Theory of fuzzy sets, etc. (03E72) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items (12)

Fuzzy linear programming problems: models and solutions ⋮ Fuzzy optimal flow on imprecise structures ⋮ The maximum flow problem of uncertain network ⋮ A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows ⋮ A generalized bi-criteria fuzzy integer flow sharing problem ⋮ 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 ⋮ Real-valued flows in a network with fuzzy arc capacities ⋮ Modeling uncertainty in networks ⋮ Fuzzy shortest paths ⋮ The fuzzy shortest path problem and its most vital arcs

Cites Work

• 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
• Unnamed Item

This page was built for publication: Maximum flow in a network with fuzzy arc capacities