Aggarwal, Charu C.; Kaplan, Haim; Tarjan, Robert E., 1948-
(Massachusetts Institute of Technology, Operations Research Center, 1996-03)
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...