Rian G. S. Pinheiro

Orcid: 0000-0002-8759-6286

According to our database1, Rian G. S. Pinheiro authored at least 24 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Service Selection under Uncertainty.
Comput. Oper. Res., 2025

2024
Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits.
J. Heuristics, December, 2024

An integrated ILS-VND strategy for solving the knapsack problem with forfeits.
J. Heuristics, December, 2024

A matheuristic approach for the minimum broadcast time problem using a biased random-key genetic algorithm.
Int. Trans. Oper. Res., January, 2024

An optimization-based framework for personal scheduling during pandemic events.
J. Braz. Comput. Soc., 2024

Optimizing public transport system using biased random-key genetic algorithm.
Appl. Soft Comput., 2024

A multi-start simulated annealing strategy for Data Lake Organization Problem.
Appl. Soft Comput., 2024

Optimizing Vehicular Users Association in Urban Mobile Networks.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2024

2023
Using adaptive memory in GRASP to find minimum conflict-free spanning trees.
Soft Comput., 2023

2022
On Conflict-Free Spanning Tree: Algorithms and Complexity.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Iterated local search for the generalized independent set problem.
Optim. Lett., 2021

Iterated local search for single machine total weighted tardiness batch scheduling.
J. Heuristics, 2021

The biclique partitioning polytope.
Discret. Appl. Math., 2021

A comparative study of GPU metaheuristics for data clustering.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

A Multi-population BRKGA for the Automatic Clustering Problem.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

2020
Efficient approaches for the Flooding Problem on graphs.
Ann. Oper. Res., 2020

A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems.
Ann. Oper. Res., 2020

2019
Optimizing 5G Networks Processes With Software Defined Networks.
Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019

2018
A matheuristic for the cell formation problem.
Optim. Lett., 2018

A hybrid iterated local search heuristic for the maximum weight independent set problem.
Optim. Lett., 2018

A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs.
Comput. Oper. Res., 2018

2016
Efficient algorithms for cluster editing.
J. Comb. Optim., 2016

On solving manufacturing cell formation via Bicluster Editing.
Eur. J. Oper. Res., 2016

2015
A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem.
Expert Syst. Appl., 2015


  Loading...