Pages that link to "Item:Q1068713"
From MaRDI portal
The following pages link to On the complexity of a pivot step of the revised simplex algorithm (Q1068713):
Displaying 11 items.
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
- Efficient parallel linear programming (Q1821686) (← 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)
- Estimating the probability that a given vector is in the convex hull of a random sample (Q2689428) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← 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)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- Analysis of Algorithms for Stable Estimation of Coefficients of Multiple Linear Regression Models (Q5062028) (← links)
- Random Projections for Linear Programming (Q5219688) (← links)
- On Simplex Pivoting Rules and Complexity Theory (Q5418981) (← links)
