Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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–16
Aardal K., Hurkens, C.A.J., Lenstra A.K. (2000) Solving a system of diophantine equations with lower and upper bounds on the variables. Mathematics of Operations Research 25:427–442
Brauer A. (1942) On a problem of partitions. American Journal of Mathematics 64:299–312
Brauer A., Shockley J.E. (1962) On a problem of Frobenius. Journal für reine und angewandte Mathematik 211:399–408
Cook W., Rutherford T., Scarf H. E., Shallcross D. (1993) An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing 5:206–212
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–293
Cornuéjols G., Urbaniak R., Weismantel R., Wolsey L.A. (1997) Decomposition of integer programs and of generating sets. In: Burkard R.E., Woeginger G.J. (eds.) Algorithms-ESA’ 97. Lecture Notes in Computer Science 1284. Springer-Verlag, Berlin, Heidelberg, 92–103
Erdős P., Graham R.L. (1972) On a linear diophantine problem of Frobenius. Acta Arithmetica 21:399–408
Greenberg H. (1988) Solution to a linear Diophantine equation for nonnegative integers. Journal of Algorithms 9:343–353
Hungerford T.W. (1996) Algebra; corrected eighth printing. Springer-Verlag, New York
Kannan R. (1991) Lattice translates of a polytope and the Frobenius Problem. Combinatorica 12:161–177
Khinchine A. (1948) A quantitative formulation of Kronecker’s theory of approximation (In Russian). Izvestiya Akademii Nauk SSR Seriya Matematika 12:113–122
Lenstra A.K., Lenstra H.W., Jr., Lovász L. (1982) Factoring polynomials with rational coefficients. Mathematische Annalen 261:515–534
Lenstra H.W., Jr., (1983) Integer programming with a fixed number of variables. Mathematics of Operations Research 8:538–548
Lovász L., Scarf H.E. (1992) The generalized basis reduction algorithm, Mathematics of Operations Research 17:751–764
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)
Rödseth Ö.J. (1978) On a linear diophantine problem of Frobenius. Journal für reine und angewandte Mathematik 301:171–178
Schrijver A. (1986) Theory of linear and integer programming, Wiley, Chichester
Selmer E.S. (1977) On the linear diophantine problem of Frobenius. Journal für reine und angewandte Mathematik 93/294:1–17
Selmer E.S., Beyer Ö. (1978) On the linear diophantine problem of Frobenius in three variables. Journal für reine und angewandte Mathematik 301:161–170
Sylvester J.J., Curran Sharp W.J. (1884). [Problem] 7382. Mathematics from the Educational Times, with Additional Papers and Solutions 41:21
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aardal, K., Lenstra, A.K. (2002). Hard Equality Constrained Integer Knapsacks. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-47867-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43676-8
Online ISBN: 978-3-540-47867-6
eBook Packages: Springer Book Archive