Performance of trigonometric generating functions on some combinatorial problems
Year of publication: |
2005-10
|
---|---|
Authors: | NESTEROV, Yu. |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | integer programming | generating functions | polynomial complexity | dynamic programming | knapsack problem |
-
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)
-
A new algorithm for the Integer Knapsack Problem and its parallelization
Almeida, F., (1995)
- More ...
-
Squared functional systems and optimization problems
NESTEROV, Yu.,
-
Computationally efficient approximations of the joint spectral radius
BLONDEL, Vincent D.,
-
Excessive gap technique in nonsmooth convex minimization
NESTEROV, Yu.,
- More ...