Complexity investigations on the ellipsoid algorithm

DOI10.1080/02331938608843119MaRDI QIDQ3738924zbMATH OpenOpenAlexFDO

Authors Guntram Scheithauer, Johannes Terno

Publication date 1986

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938608843119

zbMATH Keywords

ellipsoid algorithmTuring machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Cites work

• Einige Erläuterungen zum Khacian-Verfahren

Cited in

(6)

• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• scientific article; zbMATH DE number 3843493 (Why is no real title available?)
• Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
• scientific article; zbMATH DE number 3908161 (Why is no real title available?)
• Exact algorithms for linear programming over algebraic extensions
• An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities

This page was built for publication: Complexity investigations on the ellipsoid algorithm

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