2 papers
math.CO2006
The Random Edge Simplex Algorithm on Dual Cyclic 4-Polytopes
Rafael Gillmann
The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for ge…
math.CO2004
Revlex-Initial 0/1-Polytopes
Volker Kaibel, Rafael Mechtel
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial subsets of 0/1-vectors. These polytopes are special knapsack-polytopes. It turns…