Linear programming, the simplex algorithm and simple polytopes (Q1365056): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225299
@@ Property / cites work: Q4225299 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
+Normal rank
@@ Property / cites work @@
+Puzzles and polytope isomorphisms
@@ Property / cites work: Puzzles and polytope isomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+The simplex method. A probabilistic analysis
@@ Property / cites work: The simplex method. A probabilistic analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Las Vegas algorithms for linear and integer programming when the dimension is small
+Normal rank
@@ Property / cites work @@
+Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
+Normal rank
@@ Property / cites work @@
+A Subexponential Algorithm for Abstract Optimization Problems
+Normal rank
@@ Property / cites work @@
+Many polytopes meeting the conjectured Hirsch bound
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple way to tell a simple polytope from its graph
+Normal rank
@@ Property / cites work @@
+Q3974981
@@ Property / cites work: Q3974981 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for the diameter and height of graphs of convex polyhedra
+Normal rank
@@ Property / cites work @@
+A quasi-polynomial bound for the diameter\\of graphs of polyhedra
+Normal rank
@@ Property / cites work @@
+Q4051879
@@ Property / cites work: Q4051879 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
+Normal rank
@@ Property / cites work @@
+Paths on Polytopes
@@ Property / cites work: Paths on Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for a subexponential optimization algorithm
+Normal rank
@@ Property / cites work @@
+The maximum numbers of faces of a convex polytope
@@ Property / cites work: The maximum numbers of faces of a convex polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On simple polytopes
@@ Property / cites work: On simple polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+Q3134498
@@ Property / cites work: Q3134498 / rank @@
+Normal rank
@@ Property / cites work @@
+Small-dimensional linear programming and convex hulls made easy
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of faces of a simplicial convex polytope
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02614318
+Normal rank
@@ Property / OpenAlex ID @@
+W1981423455
@@ Property / OpenAlex ID: W1981423455 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1365056