Pages that link to "Item:Q3753810"
From MaRDI portal
The following pages link to The Efficiency of the Simplex Method: A Survey (Q3753810):
Displayed 12 items.
- Experiments with external pivoting (Q909578) (← links)
- A barrier method for dynamic Leontief-type linear programs (Q1199511) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Algebraic languages for mathematical programming (Q1261394) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- Scaling and universality of the complexity of analog computation (Q3531580) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- On the variance of the number of pivot steps required by the simplex algorithm (Q4845092) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)