The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627): Difference between revisions

@@ Property / DOI @@
-.1002/rsa.10034
@@ Property / DOI: 10.1002/rsa.10034 / rank @@
-Normal rank
@@ Property / cites work @@
+The worst-case running time of the random simplex algorithm is exponential in the height
+Normal rank
@@ Property / cites work @@
+Randomized simplex algorithms on Klee-Minty cubes
@@ Property / cites work: Randomized simplex algorithms on Klee-Minty cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Completely unimodal numberings of a simple polytope
+Normal rank
@@ Property / cites work @@
+The simplex algorithm with the pivot rule of maximizing criterion improvement
+Normal rank
@@ Property / cites work @@
+Linear programming, the simplex algorithm and simple polytopes
+Normal rank
@@ Property / cites work @@
+Lower bounds for a subexponential optimization algorithm
+Normal rank
@@ Property / cites work @@
+A subexponential bound for linear programming
@@ Property / cites work: A subexponential bound for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Convex and linear orientations of polytopal graphs
+Normal rank
@@ Property / cites work @@
+Q3622260
@@ Property / cites work: Q3622260 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/RSA.10034
@@ Property / DOI: 10.1002/RSA.10034 / rank @@
+Normal rank