What is the worst case behavior of the simplex algorithm?
From MaRDI portal
Recommendations
Cited in
(22)- Complexity of the gravitational method for linear programming
- A new family of exponential LP problems
- Criss-cross methods: A fresh view on pivot algorithms
- Systematic construction of examples for cycling in the simplex method
- The Simplex Algorithm in Dimension Three
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- Small degenerate simplices can be bad for simplex methods
- The Average number of pivot steps required by the Simplex-Method is polynomial
- On the number of degenerate simplex pivots
- On the number of degenerate simplex pivots
- Pivot rules for circuit-augmentation algorithms in linear optimization
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- The Random‐Facet simplex algorithm on combinatorial cubes
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling
- Exponential lower bounds for history-based simplex pivot rules on abstract cubes
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- An exponential lower bound for Cunningham's rule
- Goldfarb's cube
- Affirmative action algorithms
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes
This page was built for publication: What is the worst case behavior of the simplex algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622260)
