scientific article
From MaRDI portal
Publication:3973277
zbMath0747.90065MaRDI QIDQ3973277
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (3)
Polynomial algorithms for linear programming over the algebraic numbers ⋮ The equivalence of linear programs and zero-sum games ⋮ Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
This page was built for publication:
