The following pages link to (Q4066843):
Displayed 7 items.
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Application of integral geometry to linear inequalities (Q762774) (← links)
- A simple heuristic approach to simplex efficiency (Q1160562) (← links)
- Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- The complexity of linear programming (Q5904560) (← links)