SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER (Q4820060): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10637199408915470 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109037403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing interior point linear programming methods in the Optimization Subroutine Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting dense columns in sparse linear systems / rank
 
Normal rank

Latest revision as of 13:29, 7 June 2024

scientific article; zbMATH DE number 2106660
Language Label Description Also known as
English
SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
scientific article; zbMATH DE number 2106660

    Statements

    Identifiers