The complexity of approximate algorithms for the problem of integer programming

DOI10.1016/0041-5553(84)90125-3MaRDI QIDQ3682234zbMATH OpenOpenAlexFDO

Authors N. N. Kuzyurin

Publication date 1984

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(84)90125-3

zbMATH Keywords

approximate algorithmepsilon-optimal solution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Quadratic programming (90C20)

Cited in

(5)

• Integer programming in parameterized complexity: five miniatures
• scientific article; zbMATH DE number 6007902 (Why is no real title available?)
• scientific article; zbMATH DE number 6850361 (Why is no real title available?)
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• scientific article; zbMATH DE number 6460215 (Why is no real title available?)

This page was built for publication: The complexity of approximate algorithms for the problem of integer programming

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