The central path visits all the vertices of the Klee–Minty cube (Q3423600): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556780500407725
+Normal rank
@@ Property / OpenAlex ID @@
+W2155630828
@@ Property / OpenAlex ID: W2155630828 / rank @@
+Normal rank
@@ Property / cites work @@
+Pivot rules for linear programming: A survey on recent theoretical developments
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
+Normal rank
@@ Property / cites work @@
+How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3423600