Solving the minimum flow problem with interval bounds and flows

DOI10.1007/S12046-012-0100-6zbMATH Open1322.90014OpenAlexW1965423661MaRDI QIDQ746432FDOQ746432

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

Recommendations

• A new approach for solving the minimum cost flow problem with interval and fuzzy data
• Minimum cost flow time-windows problem with interval bounds and flows
• Combinatorial algorithms for the minimum interval cost flow problem
• A note on the minimum interval cost flow problem
• Minimum flow problem on network flows with time-varying bounds

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

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

Cited In (2)

• Integral flow decomposition with minimum longest path length
• On solving maximum and quickest interval-valued flows over time

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

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