A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. - Ivan C. Martins; Rian G. S. Pinheiro; Fábio Protti; Luiz Satoru Ochi (Expert Syst. Appl., 2015)

On solving manufacturing cell formation via Bicluster Editing. - Rian G. S. Pinheiro; Ivan C. Martins; Fábio Protti; Luiz S. Ochi; Luidi Gelabert Simonetti; Anand Subramanian 001 (Eur. J. Oper. Res., 2016)

Efficient algorithms for cluster editing. - Lucas de O. Bastos; Luiz Satoru Ochi; Fábio Protti; Anand Subramanian 001; Ivan César Martins; Rian Gabriel S. Pinheiro (J. Comb. Optim., 2016)

A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs. - Bruno C. S. Nogueira; Rian G. S. Pinheiro (Comput. Oper. Res., 2018)

A hybrid iterated local search heuristic for the maximum weight independent set problem. - Bruno C. S. Nogueira; Rian G. S. Pinheiro; Anand Subramanian 001 (Optim. Lett., 2018)

A matheuristic for the cell formation problem. - Rian Gabriel S. Pinheiro; Ivan C. Martins; Fábio Protti; Luiz Satoru Ochi (Optim. Lett., 2018)

Optimizing 5G Networks Processes With Software Defined Networks. - Geymerson S. Ramos; Rian G. S. Pinheiro; André L. L. de Aquino (CloudNet, 2019)

A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems. - Bruno C. S. Nogueira; Rian G. S. Pinheiro (Ann. Oper. Res., 2020)

Efficient approaches for the Flooding Problem on graphs. - André Renato Villela da Silva; Luiz Satoru Ochi; Bruno José da Silva Barros; Rian Gabriel S. Pinheiro (Ann. Oper. Res., 2020)

A Multi-population BRKGA for the Automatic Clustering Problem. - Alexandre Lima; Alfredo Lima; Bruno C. S. Nogueira; Mário Santos; Rian G. S. Pinheiro (SMC, 2021)

A comparative study of GPU metaheuristics for data clustering. - Mário Santos; Bruno C. S. Nogueira; Rian G. S. Pinheiro; Almir Pereira Guimarães; Alexandre Lima; Ermeson C. Andrade (SMC, 2021)

The biclique partitioning polytope. - Gilberto Farias de Sousa Filho; Teobaldo Bulhões; Lucídio dos Anjos F. Cabral; Luiz Satoru Ochi; Fábio Protti; Rian G. S. Pinheiro (Discret. Appl. Math., 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)

Iterated local search for the generalized independent set problem. - Bruno Costa e Silva Nogueira; Rian G. S. Pinheiro; Eduardo Tavares (Optim. Lett., 2021)

On Conflict-Free Spanning Tree: Algorithms and Complexity. - Bruno José da Silva Barros; Luiz Satoru Ochi; Rian Gabriel S. Pinheiro; Uéverton S. Souza (CALDAM, 2022)

Using adaptive memory in GRASP to find minimum conflict-free spanning trees. - Bruno José da Silva Barros; Rian Gabriel S. Pinheiro; Uéverton S. Souza; Luiz Satoru Ochi (Soft Comput., 2023)

Optimizing Vehicular Users Association in Urban Mobile Networks. - Geymerson S. Ramos; Razvan Stanica; Rian G. S. Pinheiro; André L. L. de Aquino (WCNC, 2024)

A multi-start simulated annealing strategy for Data Lake Organization Problem. - Danilo Fernandes; Geymerson S. Ramos; Rian G. S. Pinheiro; André L. L. de Aquino (Appl. Soft Comput., 2024)

Optimizing public transport system using biased random-key genetic algorithm. - João Luiz Alves Oliveira; André L. L. de Aquino; Rian G. S. Pinheiro; Bruno C. S. Nogueira (Appl. Soft Comput., 2024)

An optimization-based framework for personal scheduling during pandemic events. - Flávio Oscar Hahn; Bruno C. S. Nogueira; Rian Gabriel S. Pinheiro (J. Braz. Comput. Soc., 2024)

A matheuristic approach for the minimum broadcast time problem using a biased random-key genetic algorithm. - Alfredo Lima; André L. L. de Aquino; Bruno C. S. Nogueira; Rian G. S. Pinheiro (Int. Trans. Oper. Res., 2024)

An integrated ILS-VND strategy for solving the knapsack problem with forfeits. - Matheus Machado Vieira; Bruno Nogueira 001; Rian G. S. Pinheiro (J. Heuristics, 2024)

Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits. - Matheus Machado Vieira; Bruno Nogueira 001; Rian G. S. Pinheiro (J. Heuristics, 2024)

Service Selection under Uncertainty. - Dimas Cassimiro Nascimento Filho; Rian Gabriel S. Pinheiro (Comput. Oper. Res., 2025)

On Conflict-Free Spanning Tree: Mapping tractable and hard instances through the lenses of graph classes. - Bruno José da Silva Barros; Luiz Satoru Ochi; Rian Gabriel S. Pinheiro; Uéverton S. Souza (Theor. Comput. Sci., 2025)

Biased random-key genetic algorithms for the weighted minimum broadcast time problem. - Alfredo Lima; Luiz Satoru Ochi; Bruno Nogueira 001; Rian G. S. Pinheiro (Ann. Oper. Res., 2025)