Randomized simplex algorithms on Klee-Minty cubes
From MaRDI portal
Recommendations
Cited in
(15)- A double-pivot simplex algorithm and its upper bounds of the iteration numbers
- The Klee–Minty random edge chain moves with linear speed
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- Random walks on polytopes of constant corank
- One line and n points
- Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
- The Random‐Facet simplex algorithm on combinatorial cubes
- Random edge can be exponential on abstract cubes
- scientific article; zbMATH DE number 2196286 (Why is no real title available?)
- Exponential lower bounds for history-based simplex pivot rules on abstract cubes
- Two New Bounds for the Random‐Edge Simplex‐Algorithm
- The worst-case running time of the random simplex algorithm is exponential in the height
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes
This page was built for publication: Randomized simplex algorithms on Klee-Minty cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307309)