Add to ORKGWe show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of finding a feasible flow on a given network which minimizes the difference between the maximum and the minimum weighted flow on single arcs, can be solved in strongly polynomial time. The proposed solution algorithm consists of extending Megiddo's approach for parametric programming
We present a new algorithm for computing balanced flows in equality networks arising in market equil...
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective ij∈...
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negati...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
summary:In the minimization of the number of subtours made by the insertion head of an SMD placeme...
In this paper, we are concerned with maximum flow problems with non-zero lower bounds. The common ap...
We present two new strongly polynomial algorithms for the Minimum Cost Network Flow Problem (MCNF). ...
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
AbstractWe present two new strongly polynomial algorithms for the minimum cost network flow problem ...
We present a new strongly polynomial algorithm for generalized flow maximization. The first strongly...
We present a new strongly polynomial algorithm for generalized flow maximization. The first strongly...
We present a new strongly polynomial algorithm for generalized flow maximization that is significant...
We present a new strongly polynomial algorithm for generalized flow maximization that is significant...
We present a new algorithm for computing balanced flows in equality networks arising in market equil...
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective ij∈...
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negati...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
In this paper, a new problem on a directed network is presented. Let D be a feasible network such...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
summary:In the minimization of the number of subtours made by the insertion head of an SMD placeme...
In this paper, we are concerned with maximum flow problems with non-zero lower bounds. The common ap...
We present two new strongly polynomial algorithms for the Minimum Cost Network Flow Problem (MCNF). ...
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
AbstractWe present two new strongly polynomial algorithms for the minimum cost network flow problem ...
We present a new strongly polynomial algorithm for generalized flow maximization. The first strongly...
We present a new strongly polynomial algorithm for generalized flow maximization. The first strongly...
We present a new strongly polynomial algorithm for generalized flow maximization that is significant...
We present a new strongly polynomial algorithm for generalized flow maximization that is significant...
We present a new algorithm for computing balanced flows in equality networks arising in market equil...
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective ij∈...
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negati...