Linear programming, complexity. Separation and optimization.

From MaRDI portal

Publication:1612911

Jump to:navigation, search

zbMath1010.90041MaRDI QIDQ1612911

Jean-Francois Maurras

Publication date: 5 September 2002

Published in: Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

zbMATH Keywords

linear programming algorithmic complexity Turing machine complexity analysis ellipsoid method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)

This page was built for publication: Linear programming, complexity. Separation and optimization.

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