The objective of this study is to develop a shortest augmenting path algorithm for solving the semi-assignment problem and conduct an extensive computational comparison with the best alternative ...
Researchers from MIT, Yale University, and the University of Southern California have developed what they are labeling the "fastest known algorithm" for solving the problem of "maximum flow." The max ...
Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback