A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. - Franklin Djeumou Fomeni; Adam N. Letchford (INFORMS J. Comput., 2014)

Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. - Franklin Djeumou Fomeni; Konstantinos Kaparis; Adam N. Letchford (Math. Program., 2015)

A new family of facet defining inequalities for the maximum edge-weighted clique problem. - Franklin Djeumou Fomeni (Optim. Lett., 2017)

An RLT approach for solving the binary-constrained mixed linear complementarity problem. - Franklin Djeumou Fomeni; Steven A. Gabriel; Miguel F. Anjos (Comput. Oper. Res., 2019)

Planning efficient 4D trajectories in Air Traffic Flow Management. - Veronica Dal Sasso; Franklin Djeumou Fomeni; Guglielmo Lulli 001; Konstantinos G. Zografos (Eur. J. Oper. Res., 2019)

Applications of logic constrained equilibria to traffic networks and to power systems with storage. - Franklin Djeumou Fomeni; Steven A. Gabriel; Miguel F. Anjos (J. Oper. Res. Soc., 2019)

Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. - Teodor Gabriel Crainic; Franklin Djeumou Fomeni; Walter Rei (Comput. Oper. Res., 2021)

A cut-and-branch algorithm for the Quadratic Knapsack Problem. - Franklin Djeumou Fomeni; Konstantinos Kaparis; Adam N. Letchford (Discret. Optim., 2022)

A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem. - Franklin Djeumou Fomeni (Discret. Appl. Math., 2023)

A novel dynamic programming heuristic for the quadratic knapsack problem. - M. Eliass Fennich; Franklin Djeumou Fomeni; Leandro C. Coelho (Eur. J. Oper. Res., 2024)

Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams. - M. Eliass Fennich; Leandro C. Coelho; Franklin Djeumou Fomeni (Comput. Oper. Res., 2025)

A 3-space dynamic programming heuristic for the cubic knapsack problem. - Ibrahim Dan Dije; Franklin Djeumou Fomeni; Leandro C. Coelho (J. Comb. Optim., 2025)