The following pages link to (Q5202839):
Displaying 12 items.
- The central curve in linear programming (Q695626) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- The simplex method. A probabilistic analysis (Q1083366) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Probabilistic analysis of Simpson's quadrature (Q1342511) (← links)
- How fast does the simplex method usually work? Or: the search for (stochastic) independence (Q2249095) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- In Praise of Numerical Computation (Q3644734) (← links)
- The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
- (Q4308897) (← links)
- (Q4836276) (← links)