scientific article; zbMATH DE number 4181141

MaRDI QIDQ3204331zbMATH OpenFDO

Authors N. N. Kuzyurin

Publication date 1989

zbMATH Keywords

asymptotic algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• Asymptotically exact polynomial algorithms in integer linear programming
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Polynomial algorithms for linear programming over the algebraic numbers
• scientific article; zbMATH DE number 4062814
• On the optimality of pseudo-polynomial algorithms for integer programming
• On the optimality of pseudo-polynomial algorithms for integer programming
• scientific article; zbMATH DE number 1161055
• scientific article; zbMATH DE number 4119927
• Polynomial affine algorithms for linear programming
• Polynomial approximations for continuous linear programs

Cited in

(5)

• Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
• Polynomial algorithms for m (m+1) integer programs and m (m+k) diophantine systems
• On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
• Large final polynomials from integer programming
• 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 Q3204331)