A build-up variant of the logarithmic barrier method for LP (Q1200789): Difference between revisions

@@ Property / cites work @@
+A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Cutting planes and column generation techniques with the projective algorithm
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Solving combinatorial optimization problems using Karmarkar's algorithm
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+Q3494376
@@ Property / cites work: Q3494376 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) potential reduction algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A Potential Reduction Algorithm Allowing Column Generation
+Normal rank
@@ Property / cites work @@
+A ``build-down'' scheme for linear programming
@@ Property / cites work: A ``build-down'' scheme for linear programming / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(92)90104-b
+Normal rank
@@ Property / OpenAlex ID @@
+W2058153952
@@ Property / OpenAlex ID: W2058153952 / rank @@
+Normal rank