Continuous greedy randomized adaptive search procedure for data clustering. - Eduardo Queiroga; Anand Subramanian 001; Lucídio dos Anjos F. Cabral (Appl. Soft Comput., 2018)

A hybrid metaheuristic for the minimum labeling spanning tree problem. - Thiago Gouveia da Silva; Eduardo Queiroga; Luiz Satoru Ochi; Lucídio dos Anjos Formiga Cabral; Serigne Gueye; Philippe Michelon (Eur. J. Oper. Res., 2019)

On the exact solution of vehicle routing problems with backhauls. - Eduardo Queiroga; Yuri Frota; Ruslan Sadykov; Anand Subramanian 001; Eduardo Uchoa; Thibaut Vidal (Eur. J. Oper. Res., 2020)

Solution strategies for the vehicle routing problem with backhauls. - Anand Subramanian 001; Eduardo Queiroga (Optim. Lett., 2020)

A POPMUSIC matheuristic for the capacitated vehicle routing problem. - Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (Comput. Oper. Res., 2021)

Iterated local search for single machine total weighted tardiness batch scheduling. - Eduardo Queiroga; Rian G. S. Pinheiro; Quentin Christ; Anand Subramanian 001; Artur Alves Pessoa (J. Heuristics, 2021)

Integer programming formulations and efficient local search for relaxed correlation clustering. - Eduardo Queiroga; Anand Subramanian 001; Rosa Figueiredo 001; Yuri Frota (J. Glob. Optim., 2021)

VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. - Najib Errami; Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (INFORMS J. Comput., 2024)

Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties. - José Maurício Fernandes Medeiros; Anand Subramanian 001; Eduardo Queiroga (Optim. Lett., 2025)