Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables-Reference-Cited by-同舟云学术

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables

Published:1998 Issue: Volume: Page:229-242
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Aardal Karen,Hurkens Cor,Lenstra Arjen K.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-69346-7_18

Reference17 articles.

1. K. Aardal, A. K. Lenstra, and C. A. J. Hurkens. An algorithm for solving a diophantine equation with upper and lower bounds on the variables. Report UU-CS-97-40, Department of Computer Science, Utrecht University, 1997. ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/

2. W. Cook, T. Rutherford, H. E. Scarf, and D. Shallcross. An implementation of the generalized basis reduction algorithm for integer programming. ORSA Journal on Computing, 5:206–212, 1993.

3. D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerability. Journal of Cryptology, 10:233–260, 1997.

4. Lect Notes Comput Sci;G. Cornuéjols,1997

5. M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, and C. P. Schnorr. Improved low-density subset sum algorithms. Computational Complexity, 2:111–128, 1992.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Search for Combinatorial Objects Using Lattice Algorithms – Revisited;Lecture Notes in Computer Science;2021

2. Balanced Integer Solutions of Linear Equations;Applications of Mathematics and Informatics in Science and Engineering;2014

3. Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices;Journal of Global Optimization;2010-05-15

4. Lattice Based Extended Formulations for Integer Linear Equality Systems;SSRN Electronic Journal;2007