Publication:3206654
From MaRDI portal
zbMath0416.90041MaRDI QIDQ3206654
Publication date: 1977
computational complexity; linear programming; complexity of linear programming; efficiency of algorithms
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
90C15: Stochastic programming
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
George Dantzig's impact on the theory of computation, On the length of simplex paths: The assignment case, Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm, The Average number of pivot steps required by the Simplex-Method is polynomial