Add to ORKG"July 1987."Bibliography: p. 34-36.Supported, in part, by the Presidential Young Investigator Grant of the National Science Foundation. 8451517-ECS Supported, in part, by a grant from Analog Devices, Apple Computer,Inc., and Prime Computer.J. B. Orlin and Ravindra K. Ahuja
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
Maximum-flow problems occur in a wide range of applications. Although already well-studied, they are...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
"April 1995."Includes bibliographical references (p. 55-57).by Ravindra K. Ahuja ... [et al.
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Maximum-flow problems occur in a wide range of applications. Although already well-studied, they are...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
Also issued as: Working paper (Sloan School of Management) ; WP no. 1966-87Includes bibliographical ...
Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The pro...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
Includes bibliographical references (p. 19-20).Supported by the Air Force Office of Scientific Resea...
In this study efficient algorithms are developed for solving the classical maximum value flow proble...
Includes bibliographical references.Supported in part by the Presidential Young Investigator Grant o...
For a number of years the maximum flow network problem has at-tracted the attention of prominent res...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
Maximum-flow problems occur in a wide range of applications. Although already well-studied, they are...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
"April 1995."Includes bibliographical references (p. 55-57).by Ravindra K. Ahuja ... [et al.
ABSTRACT. This paper presents new algorithms for the maximum flow problem, the Hitchcock transportat...
Maximum-flow problems occur in a wide range of applications. Although already well-studied, they are...
AbstractAn O(EV log2 V) algorithm for finding the maximal flow in networks is described. It is asymp...
Also issued as: Working paper (Sloan School of Management) ; WP no. 1966-87Includes bibliographical ...
Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The pro...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...
Includes bibliographical references (p. 19-20).Supported by the Air Force Office of Scientific Resea...
In this study efficient algorithms are developed for solving the classical maximum value flow proble...
Includes bibliographical references.Supported in part by the Presidential Young Investigator Grant o...
For a number of years the maximum flow network problem has at-tracted the attention of prominent res...
In this paper, we present improved polynomial time algorithms for the max flow problem defined on sp...
Maximum-flow problems occur in a wide range of applications. Although already well-studied, they are...
Recently, Goldberg proposed a new approach to the maximum network flow problem. The approach yields ...