Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs
Published Online:1 Aug 2002https://doi.org/10.1287/moor.27.3.470.315
References
- Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances. J. Comput. (2000) 12(3):192–202Abstract, Google Scholar
- Solving a system of linear diophantine equations with lower and upper bounds on the variables. Math. Oper. Res. (2000) 25(3):427–442Link, Google Scholar
- A Course in Computational Algebraic Number Theory (1996) (Springer-Verlag, Berlin, Germany) Google Scholar
- La réduction de réseaux en cryptographie. (1998) . Ph.D. thesis, Ecole Polytechnique, Palaiseau, FranceGoogle Scholar
- The theory of matrices. Computer Science and Applied Mathematics (1985) 2nd ed.(Academic Press, Inc., Orlando, FL) Google Scholar
- Factoring polynomials with rational coefficients. Mathematische Annalen (1982) 261:515–534Crossref, Google Scholar
- LiDIA A library for computational number theory. http://www.informatik.th-darmstadt.de/TI/LiDIA (1999) (TH Darmstadt/Universität des Saarlandes, Fachbereich Informatik, Institut für Theoretische Informatik, Darmstadt, Germany) Google Scholar
- Résolution de problèmes d'optimisation en nombres entiers par un algorithme de réduction de base dans les treillis. Mémoire de la Faculté des Sciences Appliquées (1999) (Université catholique de Louvain, Louvain, Belgium) Google Scholar
- Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
- Integral matrices. Pure and Applied Mathematics: A Series of Monographs and Textbooks (1972) 45(Academic Press, New York) Google Scholar
- Theory of Linear and Integer Programming (1986) (John Wiley and Sons, Chichester, U.K.) Google Scholar
- Model Building in Mathematical Programming (1993) (John Wiley and Sons, Chichester, U.K.) Google Scholar

