scientific article; zbMATH DE number 1294381

MaRDI QIDQ4246509zbMATH OpenFDO

Authors A. G. Tarnovskiĭ

Publication date 4 October 1999

zbMATH Keywords

polynomial time algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Programming in abstract spaces (90C48)

Cited in

(1)

• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

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 Q4246509)