Fast Fourier Transform and its applications to integer knapsack problems
Year of publication: |
2004-09
|
---|---|
Authors: | NESTEROV, Yu |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | integer programming | knapsack problem | Fast Fourier Transform | Dynamic Programming |
-
A 3-space dynamic programming heuristic for the cubic knapsack problem
Dan Dije, Ibrahim, (2024)
-
On the exact separation of cover inequalities of maximum depth
Catanzaro, Daniele, (2021)
-
A dynamic programming-based approach for cloud instance type selection and optimisation
Wang, Pengwei, (2020)
- More ...
-
Unconstrained convex minimization in relative scale
NESTEROV, Yu, (2003)
-
Fast and precise approximations of the joint spectral radius
BLONDEL, Vincent, (2003)
-
Polynomial-time computation of the joint spectral radius for some sets of nonnegative matrices
BLONDEL, Vincent, (2008)
- More ...