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

DOI10.1016/J.AMC.2007.03.038MaRDI QIDQ990544zbMATHOpenAlexFDO

Authors Hassan Salehi Fathabadi, Mehdi Ghiyasvand

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

network flowoperation researchinfeasible networkpositive cutscaling algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
• Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
• Diagnosing infeasibilities in network flow problems
• A capacity scaling algorithm for the constrained maximum flow problem
• Finding a feasible flow in a strongly connected network

Cites work

• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• A Faster Deterministic Maximum Flow Algorithm
• A new approach for computing a most positive cut using the minimum flow algorithms
• A new approach to the maximum-flow problem
• Beyond the flow decomposition barrier
• Computing maximum mean cuts
• Improved Time Bounds for the Maximum Flow Problem
• Network flows. Theory, algorithms, and applications.
• Online load balancing and network flow
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm

Cited in

(6)

• A new algorithm for general matching problems using network flow subproblems
• Cooperative maximum-flow problem under uncertainty in logistic networks
• A new idea to evaluate networking problem and MCGDM problem in parametric interval valued Pythagorean arena
• Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
• Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
• An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem

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

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