scientific article

From MaRDI portal

Publication:3716822

Jump to:navigation, search

zbMath0588.90070MaRDI QIDQ3716822

Leonid G. Khachiyan

Publication date: 1984

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

zbMATH Keywords

survey convex polynomial programming Bounds for solutions complexity of the ellipsoid method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Integer programming (90C10) Mixed integer programming (90C11)

Related Items (3)

A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Une borne optimale pour la programmation entière quasi-convexe

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3716822&oldid=17215589"