default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRian G. S. Pinheiro
2020 – today
- 2025
[j20]Dimas Cassimiro Nascimento Filho
, Rian Gabriel S. Pinheiro:
Service Selection under Uncertainty. Comput. Oper. Res. 173: 106847 (2025)- [j19]Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza:
On Conflict-Free Spanning Tree: Mapping tractable and hard instances through the lenses of graph classes. Theor. Comput. Sci. 1031: 115081 (2025) - 2024
- [j18]João Luiz Alves Oliveira, André L. L. de Aquino, Rian G. S. Pinheiro, Bruno C. S. Nogueira:
Optimizing public transport system using biased random-key genetic algorithm. Appl. Soft Comput. 158: 111578 (2024) - [j17]Danilo Fernandes, Geymerson S. Ramos, Rian G. S. Pinheiro, André L. L. de Aquino:
A multi-start simulated annealing strategy for Data Lake Organization Problem. Appl. Soft Comput. 160: 111700 (2024) - [j16]Matheus Machado Vieira, Bruno Nogueira, Rian G. S. Pinheiro:
An integrated ILS-VND strategy for solving the knapsack problem with forfeits. J. Heuristics 30(5): 399-420 (2024) - [j15]Matheus Machado Vieira, Bruno Nogueira, Rian G. S. Pinheiro:
Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits. J. Heuristics 30(5): 421 (2024) - [j14]Alfredo Lima, André L. L. de Aquino, Bruno C. S. Nogueira, Rian G. S. Pinheiro:
A matheuristic approach for the minimum broadcast time problem using a biased random-key genetic algorithm. Int. Trans. Oper. Res. 31(1): 246-273 (2024) - [j13]Flávio Oscar Hahn, Bruno C. S. Nogueira, Rian Gabriel S. Pinheiro:
An optimization-based framework for personal scheduling during pandemic events. J. Braz. Comput. Soc. 30(1): 143-154 (2024) - [c5]Geymerson S. Ramos, Razvan Stanica, Rian G. S. Pinheiro, André L. L. de Aquino:
Optimizing Vehicular Users Association in Urban Mobile Networks. WCNC 2024: 1-6 - [i2]Geymerson S. Ramos, Razvan Stanica, Rian G. S. Pinheiro, André L. L. de Aquino:
Optimizing Vehicular Users Association in Urban Mobile Networks. CoRR abs/2409.05845 (2024) - 2023
- [j12]Bruno José da Silva Barros, Rian Gabriel S. Pinheiro, Uéverton S. Souza, Luiz Satoru Ochi:
Using adaptive memory in GRASP to find minimum conflict-free spanning trees. Soft Comput. 27(8): 4699-4712 (2023) - 2022
- [c4]Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza:
On Conflict-Free Spanning Tree: Algorithms and Complexity. CALDAM 2022: 91-102 - 2021
- [j11]Gilberto Farias de Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti, Rian G. S. Pinheiro:
The biclique partitioning polytope. Discret. Appl. Math. 301: 118-130 (2021) - [j10]Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian, Artur Alves Pessoa:
Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics 27(3): 353-438 (2021) - [j9]Bruno Costa e Silva Nogueira, Rian G. S. Pinheiro, Eduardo Tavares:
Iterated local search for the generalized independent set problem. Optim. Lett. 15(4): 1345-1369 (2021) - [c3]Alexandre Lima, Alfredo Lima, Bruno C. S. Nogueira, Mário Santos, Rian G. S. Pinheiro:
A Multi-population BRKGA for the Automatic Clustering Problem. SMC 2021: 368-373 - [c2]Mário Santos, Bruno C. S. Nogueira, Rian G. S. Pinheiro, Almir Pereira Guimarães, Alexandre Lima, Ermeson C. Andrade:
A comparative study of GPU metaheuristics for data clustering. SMC 2021: 1387-1392 - 2020
- [j8]Bruno C. S. Nogueira, Rian G. S. Pinheiro:
A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems. Ann. Oper. Res. 284(1): 367-400 (2020) - [j7]André Renato Villela da Silva, Luiz Satoru Ochi, Bruno José da Silva Barros, Rian Gabriel S. Pinheiro:
Efficient approaches for the Flooding Problem on graphs. Ann. Oper. Res. 286(1): 33-54 (2020)
2010 – 2019
- 2019
- [c1]Geymerson S. Ramos, Rian G. S. Pinheiro, André L. L. de Aquino:
Optimizing 5G Networks Processes With Software Defined Networks. CloudNet 2019: 1-6 - 2018
- [j6]Bruno C. S. Nogueira, Rian G. S. Pinheiro:
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs. Comput. Oper. Res. 90: 232-248 (2018) - [j5]Rian Gabriel S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz Satoru Ochi:
A matheuristic for the cell formation problem. Optim. Lett. 12(2): 335-346 (2018) - [j4]Bruno C. S. Nogueira, Rian G. S. Pinheiro, Anand Subramanian:
A hybrid iterated local search heuristic for the maximum weight independent set problem. Optim. Lett. 12(3): 567-583 (2018) - 2016
- [j3]Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Gelabert Simonetti, Anand Subramanian:
On solving manufacturing cell formation via Bicluster Editing. Eur. J. Oper. Res. 254(3): 769-779 (2016) - [j2]Lucas de O. Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins, Rian Gabriel S. Pinheiro:
Efficient algorithms for cluster editing. J. Comb. Optim. 31(1): 347-371 (2016) - 2015
- [j1]Ivan C. Martins, Rian G. S. Pinheiro, Fábio Protti, Luiz Satoru Ochi:
A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Syst. Appl. 42(22): 8947-8955 (2015) - 2013
- [i1]Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Simonetti, Anand Subramanian:
On Solving Manufacturing Cell Formation via Bicluster Editing. CoRR abs/1312.3288 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
