1 citations · 1 across the 1 of their papers we have counts for
1 paper
Friedrich Eisenbrand, Santosh Vempala
We show that a variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs max{cTx:Ax≤b}, whose constraint…