|Title:||Some Aspects of H.W Lenstra's Integer Programming Algorithm
|Abstract:||An algorithm for integer programming, similar to H.W. Lenstra's algorithm but 'dual' to it, in a way to be described in the text is introduced. The algorithm has basically the same complexity as Lenstra's but is easier to implement. The second part of the paper deals with linear Diophantine equations as a particular case.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1985/CS/CS0359), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1985
To the main CS technical reports page
Computer science department, Technion