The Random‐Facet simplex algorithm on combinatorial cubes
From MaRDI portal
Recommendations
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes
- Randomized simplex algorithms on Klee-Minty cubes
- Linear programming, the simplex algorithm and simple polytopes
- Two New Bounds for the Random‐Edge Simplex‐Algorithm
Cites work
- A subexponential bound for linear programming
- Completely unimodal numberings of a simple polytope
- Convex and linear orientations of polytopal graphs
- Lectures on Polytopes
- Linear programming, the simplex algorithm and simple polytopes
- Lower bounds for a subexponential optimization algorithm
- Randomized simplex algorithms on Klee-Minty cubes
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- The worst-case running time of the random simplex algorithm is exponential in the height
- What is the worst case behavior of the simplex algorithm?
Cited in
(23)- Realizability makes a difference: a complexity gap for sink-finding in USOs
- Pivoting in linear complementarity: Two polynomial-time cases
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Realizability in Matoušek unique sink orientations: characterization and complexity gap
- The Simplex Algorithm in Dimension Three
- Completely unimodal numberings of a simple polytope
- Random walks on polytopes of constant corank
- Unique End of Potential Line
- Unique end of potential line
- Unique sink orientations of grids
- One line and n points
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
- Random edge can be exponential on abstract cubes
- Directed random walks on polytopes with few facets
- Geometric random edge
- On the efficiency of algebraic simplex algorithms for solving MDPs
- scientific article; zbMATH DE number 2196286 (Why is no real title available?)
- One line and \(n\) points
- Exponential lower bounds for history-based simplex pivot rules on abstract cubes
- A unified worst case for classical simplex and policy iteration pivot rules
- An exponential lower bound for Cunningham's rule
- Two New Bounds for the Random‐Edge Simplex‐Algorithm
- Random-Edge Is Slower Than Random-Facet on Abstract Cubes
This page was built for publication: The Random‐Facet simplex algorithm on combinatorial cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537627)
