Abstract
In this paper we suggest a new e.cient technique for solving integer knapsack problems. Our algorithms can be seen as application of Fast Fourier Transform to generating functions of integer polytopes. Using this approach, it is possible to count the number of boolean solutions of a single n-dimensional Diophantine equation {a, x} = b in O(//a//1 ln//a1//lnn) operations. Another application example is an integer knapsack optimization problem of volume b, which can be solved in O(//a//1 ln//a1//ln n + b lnsq.2n) operations of exact real arithmetics. These complexity estimates improve by a factor of n the complexity of the traditional Dynamic Programming technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
