Add to ORKGIn a network with positive gains and without absorbing circuits (directed cycles) the problem of maximizing input flow is considered. A primal-dual algorithm to solve the problem is given. The restricted primal problem has been chosen such that it is a problem which can be transformed - by a scaling procedure - to a maximal flow problem in a pure network
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. T...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
The maximum generalised network flow problem is to maximise the net flow into a specified node in a ...
In a network with positive gains and without absorbing circuits (directed cycles) the problem of max...
For the maximal flow problem in a pure network there is a simple criterion for optimality: "the flow...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
The paper discuses a new fundamental result in the theory of flow networks referred to as the ‘dual ...
The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex al...
In this study efficient algorithms are developed for solving the classical maximum value flow proble...
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a ne...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
Cover title.Includes bibliographical references (p. 12).Supported in part by the ONR. N00014-1-0099 ...
This work presents an algorithm for the generalized maximum flow problem. First, we describe the tra...
A specification of the Primal Simplex algorithm for the minimal cost flow problem in a processing ne...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. T...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
The maximum generalised network flow problem is to maximise the net flow into a specified node in a ...
In a network with positive gains and without absorbing circuits (directed cycles) the problem of max...
For the maximal flow problem in a pure network there is a simple criterion for optimality: "the flow...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
The paper discuses a new fundamental result in the theory of flow networks referred to as the ‘dual ...
The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex al...
In this study efficient algorithms are developed for solving the classical maximum value flow proble...
A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a ne...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
Cover title.Includes bibliographical references (p. 12).Supported in part by the ONR. N00014-1-0099 ...
This work presents an algorithm for the generalized maximum flow problem. First, we describe the tra...
A specification of the Primal Simplex algorithm for the minimal cost flow problem in a processing ne...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. T...
In this diploma thesis the maximum flow problem is presented and investigated. Instances of this pro...
The maximum generalised network flow problem is to maximise the net flow into a specified node in a ...