A fuzzy max-flow min-cut theorem.

DOI10.1016/S0165-0114(99)00090-1zbMath1044.90531MaRDI QIDQ5931157

Phil Diamond

Publication date: 2001

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items

A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows ⋮ On solving maximum and quickest interval-valued flows over time ⋮ A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA ⋮ The maximum fuzzy weighted matching models and hybrid genetic algorithm ⋮ Maximum cut in fuzzy nature: models and algorithms ⋮ Solving the minimum flow problem with interval bounds and flows

Cites Work

• Maximal Flow Through a Network
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Operations on fuzzy numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item