Fast Fourier Transform and its applications to integer knapsack problems

Yu Nesterov

No 2004064, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

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.

Keywords: integer programming; knapsack problem; Fast Fourier Transform; Dynamic Programming (search for similar items in EconPapers)
Date: 2004-09
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2004.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2004064

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().