A bump triangular dynamic factorization algorithm for the simplex method (Q3865837): Difference between revisions

@@ Property / cites work @@
+The simplex method of linear programming using LU decomposition
+Normal rank
@@ Property / cites work @@
+Matrix augmentation and partitioning in the updating of the basis inverse
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Updated triangular factors of the basis to maintain sparsity in the product form simplex method
+Normal rank
@@ Property / cites work @@
+A complete constructive algorithm for the general mixed linear programming problem
+Normal rank
@@ Property / cites work @@
+The factorization approach to large-scale linear programming
+Normal rank
@@ Property / cites work @@
+Pivot selection methods of the Devex LP code
@@ Property / cites work: Pivot selection methods of the Devex LP code / rank @@
+Normal rank
@@ Property / cites work @@
+Reinversion with the preassigned pivot procedure
@@ Property / cites work: Reinversion with the preassigned pivot procedure / rank @@
+Normal rank
@@ Property / cites work @@
+A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
+Normal rank
@@ Property / cites work @@
+A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
+Normal rank
@@ Property / cites work @@
+Q4114710
@@ Property / cites work: Q4114710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4342463
@@ Property / cites work: Q4342463 / rank @@
+Normal rank