Exponential lower bounds for many pivot rules for the simplex method
From MaRDI portal
Cites work
- A bad network problem for the simplex method and other minimum cost flow algorithms
- A brief history of linear and mixed-integer programming computation
- A friendly smoothed analysis of the simplex method
- A randomized polynomial-time simplex algorithm for linear programming
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- A unified worst case for classical simplex and policy iteration pivot rules
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- An exponential lower bound for Zadeh's pivot rule
- Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
- Complexity of some parametric integer and network programming problems
- Computational complexity of parametric linear programming
- Erratum: ``A sharp upper bound for the expected number of shadow vertices in LP-polyhedra under orthogonal projection on two-dimensional planes
- Extremal properties of 0/1-polytopes
- Finding short paths on polytopes by the shadow vertex algorithm
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3626518 (Why is no real title available?)
- scientific article; zbMATH DE number 1241836 (Why is no real title available?)
- On Polyhedral Approximations of the Second-Order Cone
- On sub-determinants and the diameter of polyhedra
- On the shadow simplex method for curved polyhedra
- Parametric shortest paths in planar graphs
- Pivot rules for circuit-augmentation algorithms in linear optimization
- Pivot rules for linear programming: A survey on recent theoretical developments
- Small Shadows of Lattice Polytopes
- Smoothed analysis of algorithms
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
- Steepest-edge simplex algorithms for linear programming
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- The Efficiency of the Simplex Method: A Survey
- The Polyhedral Geometry of Pivot Rules and Monotone Paths
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- Upper and lower bounds on the smoothed complexity of the simplex method
- Worst case behavior of the steepest edge simplex method
This page was built for publication: Exponential lower bounds for many pivot rules for the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880146)
