Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q92953184)
Watch
English
Complexity estimates of some cutting plane methods based on the analytic barrier
scientific article published in 1995
In more languages
edit
Statements
instance of
scholarly article
0 references
title
Complexity estimates of some cutting plane methods based on the analytic barrier
(English)
0 references
author
Yurii Nesterov
series ordinal
1
object named as
Yu. Nesterov
0 references
language of work or name
English
0 references
publication date
July 1995
0 references
published in
Mathematical Programming
0 references
volume
69
0 references
page(s)
149-176
0 references
maintained by WikiProject
WikiProject Mathematics
0 references
cites work
A new polynomial-time algorithm for linear programming
0 references
Identifiers
DOI
10.1007/BF01585556
0 references
DBLP publication ID
journals/mp/Nesterov95
1 reference
stated in
DBLP Dataset 2021-01-02
retrieved
28 January 2021
zbMATH Open document ID
0857.90103
0 references
0763.90074
0 references
Sitelinks
Wikipedia
(0 entries)
edit
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit