scientific article
From MaRDI portal
Publication:3914762
zbMath0463.90070MaRDI QIDQ3914762
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitysimplex algorithmrandomized algorithmrandom linear programsKlee-Minty linear program
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items (5)
On the length of simplex paths: The assignment case ⋮ Affirmative action algorithms ⋮ Completely unimodal numberings of a simple polytope ⋮ One line and n points ⋮ The Average number of pivot steps required by the Simplex-Method is polynomial
This page was built for publication:
