Pages that link to "Item:Q4845092"
From MaRDI portal
The following pages link to On the variance of the number of pivot steps required by the simplex algorithm (Q4845092):
Displaying 5 items.
- On the asymptotic average number of efficient vertices in multiple objective linear programming (Q1273733) (← 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)
- A note on the distribution of the number of simplex iterations to optimality (Q2324058) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← 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)