Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 19340

From MaRDI portal
Publication:3976779
Jump to:navigation, search

zbMATH Open0737.90040MaRDI QIDQ3976779

E. A. Galperin

Publication date: 26 June 1992



Title of this publication is not available (Why is that?)


zbMATH Keywords

linear time algorithmasymmetric large scale linear programming


Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)



Related Items (4)

Solving Linear Programs in the Current Matrix Multiplication Time ⋮ A canonical form for pencils of matrices with applications to asymptotic linear programs ⋮ An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations ⋮ Linear approximation of execution-time constraints






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976779)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3976779&oldid=12018986"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki