Pages that link to "Item:Q1100853"
From MaRDI portal
The following pages link to A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853):
Displaying 15 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Ein beliebig startender Simplex-Algorithmus (Q794559) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- Probing through the intersection of hyperplanes (Q1262211) (← links)
- Average number of iterations of some polynomial interior-point -- algorithms for linear programming (Q1589768) (← links)
- Clusters with minimum transportation cost to centers: a case study in corn production management (Q1656940) (← links)
- Geometry of the Gass-Saaty parametric cost LP algorithm (Q1825128) (← links)
- A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm (Q1974584) (← links)
- New results on the average behavior of simplex algorithms (Q3337215) (← links)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) (← links)
- A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only (Q3755232) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
