A new algorithm for solving the feasibility problem of a network flow

DOI10.1016/j.amc.2007.03.038zbMath1193.90049OpenAlexW2050503419MaRDI QIDQ990544

Mehdi Ghiyasvand, Hassan Salehi Fathabadi

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.038

zbMATH Keywords

operation researchnetwork flowinfeasible networkpositive cutscaling algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem ⋮ Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Computing maximum mean cuts
• A new approach for computing a most positive cut using the minimum flow algorithms
• Beyond the flow decomposition barrier
• A new approach to the maximum-flow problem
• Improved Time Bounds for the Maximum Flow Problem
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
• A Faster Deterministic Maximum Flow Algorithm
• Online load balancing and network flow

This page was built for publication: A new algorithm for solving the feasibility problem of a network flow