Hard Equality Constrained Integer Knapsacks

References

• Aardal K., Hurkens C. A. J., Lenstra A. K. Solving a system of Diophantine equations with lower and upper bounds on the variables. Math. Oper. Res. (2000a) 25:427–442Link, Google Scholar
• Aardal K., Bixby R. E., Hurkens C. A. J., Lenstra A. K., Smeltink J. W. Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances. INFORMS J. Comput. (2000b) 12:192–202Link, Google Scholar
• Brauer A. On a problem of partitions. Amer. J. Math. (1942) 64:299–312Crossref, Google Scholar
• Brauer A., Shockley J. E. On a problem of Frobenius. J. Reine Angewandte Math. (1962) 211:399–408Google Scholar
• Cassels J. W. S. An Introduction to the Geometry of Numbers (1997) (Springer-Verlag, Berlin, Germany) . 2nd printing, corrected. Reprint of the 1971 ed.Google Scholar
• Cook W., Rutherford T., Scarf H. E., Shallcross D. An implementation of the generalized basis reduction algorithm for integer programming. ORSA J. Comput. (1993) 5:206–212Link, Google Scholar
• Cornuéjols G., Dawande M. A class of hard small 0–1 programs. INFORMS J. Comput. (1999) 11:205–210Link, Google Scholar
• Cornuéjols G., Urbaniak R., Weismantel R., Wolsey L. A., Burkard R. E., Woeginger G. J. Decomposition of integer programs and of generating sets. Algorithms—ESA '97 (1997) (Springer-Verlag, Berlin, Germany) 92–103Lecture Notes in Computer Science, No. 1284.Crossref, Google Scholar
• Erdős P., Graham R. L. On a linear Diophantine problem of Frobenius. Acta Arithmetica (1972) 21:399–408Crossref, Google Scholar
• Greenberg H. Solution to a linear Diophantine equation for nonnegative integers. J. Algorithms (1988) 9:343–353Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1988) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Hungerford T. W. Algebra (1996) (Springer-Verlag, New York) . 8th printing corrected.Google Scholar
• Kannan R. Lattice translates of a polytope and the Frobenius problem. Combinatorica (1992) 12:161–177Crossref, Google Scholar
• Khinchine A. A quantitative formulation of Kronecker's theory of approximation (in Russian). Izvestiya Akademii Nauk SSR Seriya Matematika (1948) 12:113–122Google Scholar
• Lenstra A. K., Lenstra H. W., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. (1982) 261:515–534Crossref, Google Scholar
• Lenstra H. W. Integer programming with a fixed number of variables. Math. Oper. Res. (1983) 8:538–548Link, Google Scholar
• Lovász L., Scarf H. E. The generalized basis reduction algorithm. Math. Oper. Res. (1992) 17:751–764Link, Google Scholar
• Louveaux Q., Wolsey L. A. Combining problem structure with basis reduction to solve a class of hard integer programs. Math. Oper. Res. (2002) 27:470–484Link, Google Scholar
• Nguyen P. Q., Stern J., Bosma W. Lattice reduction in cryptology. Algorithmic Number Theory: 4th International Symposium, ANTS-IV (2000) July 2–7, 2000Leiden, The Netherlands(Springer-Verlag, Berlin, Heidelberg) 85–112Proceedings, Lecture Notes in Computer Science, No. 1838(An updated version can be found at http://www.di.ens.fr/∼pnguyen/pub.html)Crossref, Google Scholar
• Ramírez Alfonsín J. L. Complexity of the Frobenius problem. Combinatorica (1996) 16:143–147Crossref, Google Scholar
• Rödseth Ö. J. On a linear Diophantine problem of Frobenius. J. Reine Angewandte Math. (1978) 301:171–178Google Scholar
• Schrijver A. Theory of Linear and Integer Programming (1986) (Wiley, Chichester, U.K) Google Scholar
• Selmer E. S. On the linear Diophantine problem of Frobenius. J. Reine Angewandte Math. (1977) 293/294:1–17Google Scholar
• Selmer E. S., Beyer Ö. On the linear Diophantine problem of Frobenius in three variables. J. Reine Angewandte Math. (1978) 301:161–170Google Scholar
• Sylvester J. J., Curran Sharp W. J. [Problem] 7382. Mathematics from the Educational Times, with Additional Papers and Solutions (1884) 41:21Google Scholar
• Williams H. P.Model Building in Mathematical Programming (1978) (John Wiley & Sons Ltd., Chichester, U.K) Google Scholar