A practicable steepest-edge simplex algorithm (Q3887219): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A stabilization of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot selection methods of the Devex LP code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629405 / rank
 
Normal rank

Revision as of 09:21, 13 June 2024

scientific article
Language Label Description Also known as
English
A practicable steepest-edge simplex algorithm
scientific article

    Statements

    Identifiers