Hard Equality Constrained Integer Knapsacks
We consider the following integer feasibility problem: “Given positive integer numbers a 0, a 1,..., a n, with gcd(a 1,..., a n) = 1 and a = (a 1,..., a n), does there exist a nonnegative integer vector x satisfying ax = a 0?” Some instances of this type have been found to be extremely hard to solve by standard methods such as branch-and-bound, even if the number of variables is as small as ten. We observe that not only the sizes of the numbers a 0, a 1,..., a n, but also their structure, have a large impact on the difficulty of the instances. Moreover, we demonstrate that the characteristics that make the instances so difficult to solve by branch-and-bound make the solution of a certain reformulation of the problem almost trivial. We accompany our results by a small computational study.
KeywordsInteger Vector Short Vector Search Node Positive Integer Number Frobenius Number
Unable to display preview. Download preview PDF.
- 1.Aardal K., Bixby R.E., Hurkens C.A.J., Lenstra A.K., Smeltink J.W. (1999) Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. In: Cornuéjols G., Burkard R.E., Woeginger G.J. (eds.) Integer Programming and Combinatorial Optimization, 7th International IPCO Conference. Lecture Notes in Computer Science 1610. Springer-Verlag, Berlin, Heidelberg, 1–16CrossRefGoogle Scholar
- 6.Cornuéjols G., Dawande M. (1998) A class of hard small 0-1 programs. In: Bixby R.E., Boyd E.A., Ríos-Mercado R.Z. (eds.) Integer Programming and Combinatorial Optimization, 6th International IPCO Conference. Lecture Notes in Computer Science 1412. Springer-Verlag, Berlin Heidelberg, 284–293CrossRefGoogle Scholar
- 10.Hungerford T.W. (1996) Algebra; corrected eighth printing. Springer-Verlag, New YorkGoogle Scholar
- 12.Khinchine A. (1948) A quantitative formulation of Kronecker’s theory of approximation (In Russian). Izvestiya Akademii Nauk SSR Seriya Matematika 12:113–122Google Scholar
- 16.Louveaux Q., Wolsey L.A. (2000) Combining problem structure with basis reduction to solve a class of hard integer programs. CORE Discussion Paper 2000/51, CORE, Université Catholique de Louvain, 6 Louvain-la-Neuve, Belgium (to appear in Mathematics of Operations research)Google Scholar
- 21.Sylvester J.J., Curran Sharp W.J. (1884). [Problem] 7382. Mathematics from the Educational Times, with Additional Papers and Solutions 41:21Google Scholar