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)

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)