Pages that link to "Item:Q3755232"
From MaRDI portal
The following pages link to 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):
Displayed 7 items.
- A primal-dual simplex method for linear programs (Q688212) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- A computationally stable solution algorithm for linear programs (Q2372034) (← links)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (Q3755229) (← links)