Eduardo A. J. Anacleto

According to our database, Eduardo A. J. Anacleto authored at least 5 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2023

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., November, 2023

2022

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

2021

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

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

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

Proceedings of the IEEE Congress on Evolutionary Computation, 2020