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 in his algorithm are performing the relabeling operations on nodes, selecting entering arcs for pivots, and performing the pivots. We show how to speed up these operations so as to yield an algorithm whose running time is O(nm. log n) per scaling phase. We show how to extend the dynamic-tree data-structure in order to implement these algorithms. The extension may possibly have other applications as well.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5266 |
| Date | 03 1900 |
| Creators | Aggarwal, Charu C., Kaplan, Haim, Tarjan, Robert E., 1948- |
| Publisher | Massachusetts Institute of Technology, Operations Research Center |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Working Paper |
| Format | 974941 bytes, application/pdf |
| Relation | Operations Research Center Working Paper;OR 315-96 |
Page generated in 0.0024 seconds