Performance of trigonometric generating functions on some combinatorial problems

Yu. Nesterov

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

Abstract: In this paper we analyze computational performance of dual trigonometric generating functions on some integer programming problems. We show that if the number of equality constraints is fixed, then this technique allows to solve the problems in time, which is polynomial in the dimension of the space of variables.

Keywords: integer programming; generating functions; polynomial complexity; dynamic programming; knapsack problem (search for similar items in EconPapers)
Date: 2005-10
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2005.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:2005069

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 ().