A new approach for computing a most positive cut using the minimum flow algorithms

DOI10.1016/j.amc.2005.09.058zbMath1098.65062OpenAlexW2080904092MaRDI QIDQ2493746

Mehdi Ghiyasvand

Publication date: 16 June 2006

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

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

zbMATH Keywords

algorithmnetwork flowminimum flowmost positive cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (2)

An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem ⋮ A new algorithm for solving the feasibility problem of a network flow

Cites Work

• Unnamed Item
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
• Tight bounds on the number of minimum-mean cycle cancellations and related results
• Sequential and parallel algorithms for minimum flows.
• Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
• 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
• Canceling most helpful total cuts for minimum cost network flow
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks

This page was built for publication: A new approach for computing a most positive cut using the minimum flow algorithms