A new algorithm for solving the feasibility problem of a network flow
From MaRDI portal
Publication:990544
DOI10.1016/J.AMC.2007.03.038zbMATH Open1193.90049OpenAlexW2050503419MaRDI QIDQ990544FDOQ990544
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
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
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Beyond the flow decomposition barrier
- A new approach to the maximum-flow problem
- A Faster Deterministic Maximum Flow Algorithm
- Online load balancing and network flow
- Computing maximum mean cuts
- A new approach for computing a most positive cut using the minimum flow algorithms
- 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
Cited In (6)
- Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility
- A new algorithm for general matching problems using network flow subproblems
- A new idea to evaluate networking problem and MCGDM problem in parametric interval valued Pythagorean arena
- Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
- Cooperative maximum-flow problem under uncertainty in logistic networks
- 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)
