Abstract
In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. We describe subexponential randomized pivot rules and upper bounds on the diameter of graphs of polytopes.
| Original language | English |
|---|---|
| Pages (from-to) | 217-233 |
| Number of pages | 17 |
| Journal | Mathematical Programming |
| Volume | 79 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 1 Oct 1997 |
Keywords
- Combinatorial theory of simple polytopes
- Randomized pivot rule complexity
- Simplex algorithm