Friday, 15:15 - 15:40 h, Room: H 3005

 

Franklin Djeumou Fomeni
A dynamic programming heuristic for the quadratic knapsack problem

Coauthor: Adam N. Letchford

 

Abstract:
It is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in pseudo-polynomial time. The quadratic knapsack problem, by contrast, is NP-hard in the strong sense, which makes it unlikely that it can be solved in pseudo-polynomial time. It is possible, however, to convert the dynamic programming approach to the linear knapsack problem into a heuristic for the quadratic version. We explain how this can be done, and present some extremely promising computational results.

 

Talk 1 of the invited session Fri.3.H 3005
"Nonlinear combinatorial optimization problems II" [...]
Cluster 2
"Combinatorial optimization" [...]

 

  . Of course, the choice is not that easy, as there exist great number of different preparations. Notwithstanding, Cialis is the one that definitely differs from all other products.