The complexity of approximate algorithms for the problem of integer programming

DOI10.1016/0041-5553(84)90125-3zbMath0566.90058OpenAlexW1974788135MaRDI QIDQ3682234

Nikolaj Nikolaevich 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) Integer programming (90C10) Quadratic programming (90C20) Linear programming (90C05) Boolean programming (90C09)

Related Items (1)

Integer programming in parameterized complexity: five miniatures

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