Maximum flow in a network with fuzzy arc capacities

DOI10.1016/0165-0114(82)90006-9MaRDI QIDQ1167060zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3526474 (Why is no real title available?)
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• A note on two problems in connexion with graphs
• Decision-Making in a Fuzzy Environment
• Fuzzy programming and linear programming with several objective functions
• Maximal Flow Through a Network
• Sensitivity analysis in fuzzy linear programming

Cited in

(12)

• Fuzzy optimal flow on imprecise structures
• Applications of fuzzy chaos to fuzzy simulation
• Fuzzy linear programming problems: models and solutions
• Fuzzy decision networks and deconvolution
• A generalized bi-criteria fuzzy integer flow sharing problem
• Modeling uncertainty in networks
• Real-valued flows in a network with fuzzy arc capacities
• A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows
• A new approach for solving the minimum cost flow problem with interval and fuzzy data
• The maximum flow problem of uncertain network
• Fuzzy shortest paths
• The fuzzy shortest path problem and its most vital arcs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1167060)