Eliass Fennich
RetourPublications
Cahiers du GERAD
sept. 2024
G-2024-56
Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...
référence BibTeX
juin 2023
The Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that has attracted much attention over the past four decades. In this problem, o...
référence BibTeXArticles
déc. 2025
Eliass Fennich, Leandro C. Coelho et Franklin Djeumou Fomeni
Computers & Operations Research, 184, No article: 107197, 2025
référence BibTeX
nov. 2024
Eliass Fennich, Franklin Djeumou Fomeni et Leandro C. Coelho
European Journal of Operational Research, 319(1), 102–120, 2024
référence BibTeX