Pages that link to "Item:Q4537627"
From MaRDI portal
The following pages link to The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627):
Displaying 15 items.
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Completely unimodal numberings of a simple polytope (Q1107444) (← links)
- Randomized simplex algorithms on Klee-Minty cubes (Q1307309) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Directed random walks on polytopes with few facets (Q1690029) (← links)
- Unique end of potential line (Q2194856) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Geometric random edge (Q2364496) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- One line and n points (Q4446873) (← links)
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes (Q4598190) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- (Q5111758) (← links)