Minimum cost flows
نویسنده
چکیده
منابع مشابه
Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملNew polynomial-time cycle-canceling algorithms for minimum-cost flows
The cycle-canceling algorithm is one of the earliest algorithms to solve the minimum cost flow problem. This algorithm maintains a feasible solution x in the network G and proceeds by augmenting flows along negative cost directed cycles in the residual network G(x) and thereby canceling them. For the minimum cost flow problem with integral data, the generic version of the cycle-canceling algori...
متن کاملM4 1 4 No.2.o>4f- *^^ Working Paper Alfred P. Sloan School of Management Finding Minimum-cost Flows Hy Double Scaling Finding Minimum-cost Flows I$y Double Scaling Finding Minimum-cost Flows by Double Scaling
Several researchers have recendy develof)ed new techniques that give fast aJgorithms for the minimuin-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in 0{nm log log U log(nC)) time on networks with n vertices, m arcs, ma.ximum arc capacity U, and maximum arc cost magnitude C. TTie major techniques used are the capacity-scaling approach of E...
متن کاملA Polynomial-time Algorithm for the Generalized Independent-flow Problem
We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimumcost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow prob...
متن کاملLaplace's Equation and Network Flows
This paper shows that partial differential equations may be a possible area of application of mathematical programming. The solution of Laplace's equation with Neumann's condition is shown to be a minimum cost network flow problem with cost proportional to the arc flow. An algorithm of solving minimum quadratic cost network flow is given.
متن کامل