On the variance of the number of pivot steps required by the simplex algorithm (Q4845092): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The simplex method. A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5728806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur L'enveloppe convexe des nuages de points aleatoires dans <i>R<sup>n</sup></i>. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of the Simplex Method: A Survey / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01415671 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234149867 / rank
 
Normal rank

Latest revision as of 09:36, 30 July 2024

scientific article; zbMATH DE number 792546
Language Label Description Also known as
English
On the variance of the number of pivot steps required by the simplex algorithm
scientific article; zbMATH DE number 792546

    Statements

    On the variance of the number of pivot steps required by the simplex algorithm (English)
    0 references
    0 references
    6 August 1996
    0 references
    shadow vertex algorithm
    0 references
    asymptotic probabilistic analysis
    0 references

    Identifiers