Pages that link to "Item:Q1307309"
From MaRDI portal
The following pages link to Randomized simplex algorithms on Klee-Minty cubes (Q1307309):
Displayed 9 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- One line and n points (Q4446873) (← links)
- The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)
- (Q5111758) (← links)
- Random Walks on Polytopes of Constant Corank (Q5116520) (← links)