Solving the undirected minimum cost flow problem with arbitrary costs
Copyright policy )Solving the undirected minimum cost flow problem with arbitrary costs
AbstractWe address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This situation implies that the flow can take values that are integer multiple of ½. Therefore, this single commodity flow problem does not satisfy the unimodularity property. However, using a reformulation of the original problem, we develop an easy method for solving it using any classical minimum‐cost flow problem algorithm. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(1), 1–3 2005
- University of La Laguna Spain
Network design and communication in computer systems, undirected minimum cost flow problem, network flows
Network design and communication in computer systems, undirected minimum cost flow problem, network flows
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!