Solving the minimum flow problem with interval bounds and flows

DOI10.1007/s12046-012-0100-6zbMath1322.90014OpenAlexW1965423661MaRDI QIDQ746432

Mehdi Ghiyasvand

Publication date: 16 October 2015

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/037/06/0665-0674

zbMATH Keywords

network flowsinterval dataminimum flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Inverse minimum flow problem
• A note on the extension principle for fuzzy sets
• Algorithms for minimum flows.
• Sequential and parallel algorithms for minimum flows.
• A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA
• A Computational Test for Convergence of Iterative Methods for Nonlinear Systems
• A fuzzy max-flow min-cut theorem.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the minimum flow problem with interval bounds and flows