Worst case behavior of the steepest edge simplex method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- 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 3206575 (Why is no real title available?)
- A practicable steepest-edge simplex algorithm
- The simplex algorithm with the pivot rule of maximizing criterion improvement
Cited in
(19)- Fast finite methods for a system of linear inequalities
- Complexity of the gravitational method for linear programming
- An efficient simplex type algorithm for sparse and dense linear programs.
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers
- A new family of exponential LP problems
- A friendly smoothed analysis of the simplex method
- On scaling linear programs—some experimental results
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
- Constraint satisfaction problems over numeric domains
- On the length of monotone paths in polyhedra
- Pivot rules for circuit-augmentation algorithms in linear optimization
- An exponential lower bound for Zadeh's pivot rule
- Practical finite pivoting rules for the simplex method
- Inapproximability of shortest paths on perfect matching polytopes
- Upper and lower bounds on the smoothed complexity of the simplex method
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- The ellipsoid method and its implications
This page was built for publication: Worst case behavior of the steepest edge simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134626)
