Talk:Minimum-cost flow problem

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science (Rated Start-class, Mid-importance)
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Start-Class article Start  This article has been rated as Start-Class on the project's quality scale.
 Mid  This article has been rated as Mid-importance on the project's importance scale.
 

Previously, under Relation to other problems, the reduction to maximum flow said it requires all arcs considered to be of the same cost which is untrue. If all arcs have the same positive costs, the algorithm will try to minimize the number of arcs it takes, which is not necessary for the maximum flow problem. I updated this.PurpleMage (talk) 20:43, 4 December 2010 (UTC)

The current version states that setting all costs to zero recovers the maximum flow problem but this would permit anything as a solution because the function being minimized would always be zero. —Preceding unsigned comment added by 91.125.104.198 (talk) 23:05, 26 March 2011 (UTC)

In the section 'relation to other problems' a lower bound $l$ on the edges is mentioned, which is absent from the definition. I'm in favor of including the lower bound in the definition as well.