Pages that link to "Item:Q2463487"
From MaRDI portal
The following pages link to A largest-distance pivot rule for the simplex algorithm (Q2463487):
Displaying 4 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Book review of: P.-Q. Pan, Linear programming computation (Q1754296) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
