Abstract
As already mentioned, solving the integer program Pd is still a formidable computational challenge. For instance, recall that the following small 5-variables integer program (taken from a list of hard knapsack problems in Aardal and Lenstra [2])
Cite
CITATION STYLE
APA
Lasserre, J. B. (2009). Barvinok’s Counting Algorithm and Gomory Relaxations. In Springer Series in Operations Research and Financial Engineering (pp. 107–113). Springer Nature. https://doi.org/10.1007/978-0-387-09414-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free