[en] We consider a hard integer programming problem that is difficult for the standard
branch-and-bound approach even for small instances. A reformulation based
on lattice basis reduction is known to be more effective. However
the step to compute the reduced basis, even if it is found in polynomial time, becomes a bottleneck
for small to medium instances. By using the structure of the problem,
we show that we can decompose the problem and obtain the basis by
taking the kronecker product of two smaller bases easier to compute. Furthermore,
if the two small bases are reduced, the kronecker product is also reduced
up to a reordering of the vectors. Computational results show the gain from such an approach.
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Aardal K., Bixby R.E., Hurkens C.A.J., Lenstra A.K., Smeltink J.W. (2000) Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances. J. Comput. 12(3):192-202.
Hurkens C.A.J., Lenstra A.K. (2000) Solving a system of linear diophantine equations with lower and upper bounds on the variables. Math. Oper. Res. 25(3):427-442.
Cohen H. A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, Germany; 1996.
Joux A. La réduction de réseaux en cryptographie, Ph.D. thesis, Ecole Polytechnique, Palaiseau, France; 1998.
Lancaster P., Tismenetsky M. (1985) The theory of matrices, 2nd ed. Computer Science and Applied Mathematics, Academic Press, Inc., Orlando, FL; .
Lenstra A.K., Lenstra H.W., Lovász L. (1982) Factoring polynomials with rational coefficients. Mathematische Annalen 261:515-534.
A library for computational number theory, LiDIA. TH Darmstadt/Universität des Saarlandes, Fachbereich Informatik, Institut für Theoretische Informatik, Darmstadt, Germany; 1999. http://www.informatik.th-darmstadt.de/TI/LiDIA
Louveaux Q. (1999) 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, Université catholique de Louvain, Louvain, Belgium; .
Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization, John Wiley and Sons, New York; 1988.
Newman M. (1972) Integral matrices. Pure and Applied Mathematics: A Series of Monographs and Textbooks , Academic Press, New York; 45.
Schrijver A. Theory of Linear and Integer Programming, John Wiley and Sons, Chichester, U.K.; 1986.
Williams H.P. Model Building in Mathematical Programming, John Wiley and Sons, Chichester, U.K.; 1993.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.