scientific article

zbMath0416.90041MaRDI QIDQ3206654

Karl Heinz Borgwardt

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitylinear programmingcomplexity of linear programmingefficiency of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Stochastic programming (90C15) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

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 ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model ⋮ George Dantzig's impact on the theory of computation ⋮ The Average number of pivot steps required by the Simplex-Method is polynomial

This page was built for publication: