An efficient search direction for linear programming problems (Q5955478): 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 new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a dual affine variant of Karmarkar's method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Search Directions for Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Interior-Point and Pivoting Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank

Latest revision as of 22:47, 3 June 2024

scientific article; zbMATH DE number 1704561
Language Label Description Also known as
English
An efficient search direction for linear programming problems
scientific article; zbMATH DE number 1704561

    Statements

    Identifiers