The complexity of linear programming (Q5904897): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1111/j.1467-9574.1981.tb00717.x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1467-9574.1981.tb00717.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017177415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Commodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zufällige konvexe Polyeder im \(n\)-dimensionalen Euklidischen Raum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5733470 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/J.1467-9574.1981.TB00717.X / rank
 
Normal rank

Latest revision as of 00:00, 22 December 2024

scientific article; zbMATH DE number 3737374
Language Label Description Also known as
English
The complexity of linear programming
scientific article; zbMATH DE number 3737374

    Statements

    Identifiers