Pages that link to "Item:Q2768279"
From MaRDI portal
The following pages link to Randomized combinatorial algorithms for linear programming when the dimension is moderately high (Q2768279):
Displaying 5 items.
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems (Q1611006) (← links)
- A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
- (Q3128899) (← links)
- Linear programming — Randomization and abstract frameworks (Q4593969) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)