Complexity of linear programming (Q1165154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/0167-6377(82)90047-5; 10.7916/D8TM7K45 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khachiyan's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Solve Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The great mathematical sputnik of 1979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linear programming algorithm - better or worse than the simplex method? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Complexity of Newton Iteration for Operator Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/0167-6377(82)90047-5 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7916/D8TM7K45 / rank
 
Normal rank

Latest revision as of 10:08, 25 September 2024

scientific article
Language Label Description Also known as
English
Complexity of linear programming
scientific article

    Statements

    Complexity of linear programming (English)
    0 references
    0 references
    0 references
    1982
    0 references
    complexity of linear programming
    0 references
    real number models
    0 references
    integer model
    0 references
    ellipsoid algorithm
    0 references
    polynomial-time algorithm
    0 references
    linear inequalities
    0 references
    models of computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references