Now showing items 1-1 of 1
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
(Georgia Institute of Technology, 2011-11-11)
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most deterministic pivoting rules are known, however, to need an exponential number of steps to solve some linear ...