Asymptotically exact polynomial algorithms in integer linear programming

DOI10.1515/DMA.1991.1.2.171MaRDI QIDQ3358527zbMATH OpenOpenAlexFDO

Authors N. N. Kuzyurin

Publication date 1991

Published in dma (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1991.1.2.171

zbMATH Keywords

asymptotic algorithmasymptotically exact polynomial algorithms

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)

Cited in

(7)

• 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
• scientific article; zbMATH DE number 4181141 (Why is no real title available?)
• Large final polynomials from integer programming
• An efficient linearization technique for mixed 0-1 polynomial problem
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices

This page was built for publication: Asymptotically exact polynomial algorithms in integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358527)