Abstract.
This paper presents a polynomial-time dual simplex algorithm for the generalized circulation problem. An efficient implementation of this algorithm is given that has a worst-case running time of O(m 2(m+nlogn)logB), where n is the number of nodes, m is the number of arcs and B is the largest integer used to represent the rational gain factors and integral capacities in the network. This running time is as fast as the running time of any combinatorial algorithm that has been proposed thus far for solving the generalized circulation problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: June 1998 / Accepted: June 27, 2001¶Published online September 17, 2001
Rights and permissions
About this article
Cite this article
Goldfarb, D., Jin, Z. & Lin, Y. A polynomial dual simplex algorithm for the generalized circulation problem. Math. Program. 91, 271–288 (2002). https://doi.org/10.1007/s101070100248
Issue Date:
DOI: https://doi.org/10.1007/s101070100248