On the efficacy of distributed simplex algorithms for linear programming (Q1342885): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Product Form for the Inverse in the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / 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: Vector processing in simplex and interior methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load balancing in the parallel optimization of block-angular linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinversion with the preassigned pivot procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of linear programs using parallel computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A timing model for the revised simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel bundle-based decomposition for large-scale structured mathematical programming problems / rank
 
Normal rank

Latest revision as of 11:28, 23 May 2024

scientific article
Language Label Description Also known as
English
On the efficacy of distributed simplex algorithms for linear programming
scientific article

    Statements