Franklin Djeumou Fomeni
RetourPublications
Cahiers du GERAD
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
The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...
référence BibTeX
"L'eau c'est la vie" is a well known french expression for "Water is life", which reflects the fact that water is undoubtedly the most vital resource in the ...
référence BibTeX
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 BibTeX
The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which amounts to maximizing a quadratic function of binary variables,...
référence BibTeX
This paper considers a family of cutting planes, recently developed for mixed 0-1 polynomial programs and shows that they define facets for the maximum edge-...
référence BibTeX
It is well known that the mixed linear complementarity problem can be used to model the equilibrium in energy markets as well as a host of other engineering ...
référence BibTeX