| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524108 | Operations Research Letters | 2005 | 7 Pages |
Abstract
Norton, Plotkin and Tardos proved that-loosely spoken, an LP problem is solvable in time O(Tqk+1) if deleting k fixed columns or rows, we obtain a problem which can be solved by an algorithm that makes at most T steps and q comparisons. This paper improves this running time to O(Tqk).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Alpár Jüttner,