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

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

zbMath1261.01016MaRDI QIDQ2920268

Leonid G. Khachiyan

Publication date: 25 October 2012


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimizationgame problemscomplexity boundsellipsoid methodenumeration and generation problemspolynomial linear programming


Mathematics Subject Classification ID

Linear programming (90C05) Biographies, obituaries, personalia, bibliographies (01A70) History of game theory, economics, and finance (91-03) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) History of combinatorics (05-03)


Related Items (1)

On efficient randomized algorithms for finding the PageRank vector







This page was built for publication:

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