Pages that link to "Item:Q1134626"
From MaRDI portal
The following pages link to Worst case behavior of the steepest edge simplex method (Q1134626):
Displaying 17 items.
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- On scaling linear programs—some experimental results (Q3835674) (← links)
- The Average number of pivot steps required by the Simplex-Method is polynomial (Q3950310) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
