scientific article; zbMATH DE number 3483788

MaRDI QIDQ4066843zbMATH OpenFDO

Authors Thomas M. Liebling

Publication date 1973

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited in

(7)

• A simple heuristic approach to simplex efficiency
• Iterative computation of security strategies of matrix games with growing action set
• On the average number of steps of the simplex method of linear programming
• Low order polynomial bounds on the expected performance of local improvement algorithms
• The complexity of linear programming
• On the number of iterations of local improvement algorithms
• Application of integral geometry to linear inequalities

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066843)