Pages that link to "Item:Q3865837"

The following pages link to A bump triangular dynamic factorization algorithm for the simplex method (Q3865837):

Displaying 7 items.

• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
• Dynamic factorization in large-scale optimization (Q1330893) (← links)
• A Hierarchical Representation of the Inverse for Sparse Matrices (Q3321333) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem (Q3694975) (← links)
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)