NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem. - Santiago Valdés Ravelo; Cláudio N. Meneses; Eduardo A. J. Anacleto (CEC, 2020)

Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. - Eduardo A. J. Anacleto; Cláudio N. Meneses; Santiago Valdés Ravelo (Comput. Oper. Res., 2020)

Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. - Santiago Valdés Ravelo; Cláudio N. Meneses; Maristela Oliveira Santos (J. Heuristics, 2020)

Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints. - Eduardo A. J. Anacleto; Cláudio N. Meneses; Ricardo N. Liang (Comput. Oper. Res., 2021)

Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems. - Santiago Valdés Ravelo; Cláudio N. Meneses (Comput. Oper. Res., 2021)

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems. - Ricardo N. Liang; Eduardo A. J. Anacleto; Cláudio N. Meneses (J. Heuristics, 2022)

Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation. - Ricardo N. Liang; Eduardo A. J. Anacleto; Cláudio N. Meneses (Comput. Oper. Res., 2023)