scientific article

zbMATH Open0716.90081MaRDI QIDQ3204331

N. N. Kuzyurin

Publication date: 1989

Title of this publication is not available (Why is that?)

zbMATH Keywords

asymptotic algorithm

Mathematics Subject Classification ID

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

Related Items (5)

Large final polynomials from integer programming ⋮ Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4 ⋮ Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices ⋮ Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems ⋮ On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Polynomial algorithms for linear programming over the algebraic numbers 👍 👎
• Polynomial affine algorithms for linear programming 👍 👎
• On the optimality of pseudo-polynomial algorithms for integer programming 👍 👎
• Polynomial approximations for continuous linear programs 👍 👎
• Towards a Genuinely Polynomial Algorithm for Linear Programming 👍 👎
• Asymptotically exact polynomial algorithms in integer linear programming 👍 👎
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming 👍 👎

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)