default search action
Gilberto F. de S. Filho
Person information
- affiliation: Federal University of Paraíba, Joao Pessoa, PB, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]Gilberto Farias de Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral
, Luiz Satoru Ochi, Fábio Protti
The biclique partitioning polytope. Discret. Appl. Math. 301: 118-130 (2021) - [j9]Felipe C. Fragoso, Gilberto Farias de Sousa Filho
Declawing a graph: polyhedra and Branch-and-Cut algorithms. J. Comb. Optim. 42(1): 85-124 (2021)
2010 – 2019
- 2019
- [j8]Augusto Bordini, Fábio Protti, Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho:
New algorithms for the minimum coloring cut problem. Int. Trans. Oper. Res. 26(5): 1868-1883 (2019) - [i1]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Luiz Satoru Ochi, Philippe Michelon, Serigne Gueye, Lucídio A. F. Cabral:
Solving the minimum labeling global cut problem by mathematical programming. CoRR abs/1903.04319 (2019) - 2018
- [j7]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Igor A. M. Barbosa, Nenad Mladenovic
Efficient heuristics for the minimum labeling global cut problem. Electron. Notes Discret. Math. 66: 23-30 (2018) - 2017
- [j6]Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi
New heuristics for the Bicluster Editing Problem. Ann. Oper. Res. 258(2): 781-814 (2017) - [j5]Teobaldo L. Bulhões Júnior
Branch-and-price for p-cluster editing. Comput. Optim. Appl. 67(2): 293-316 (2017) - [j4]Teobaldo L. Bulhões Júnior
Branch-and-cut approaches for p-Cluster Editing. Discret. Appl. Math. 219: 51-64 (2017) - 2016
- [j3]Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi
A parallel hybrid metaheuristic for bicluster editing. Int. Trans. Oper. Res. 23(3): 409-431 (2016) - 2013
- [c3]Jarbele Cássia da Silva, Alisson V. Brito, Gilberto F. de S. Filho:
Um estudo de caso sobre a avaliação energética de software como uma contribuição à Computação Verde. SBSI 2013: 577-588 - 2012
- [j2]Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi
Hybrid Metaheuristic for Bicluster Editing Problem. Electron. Notes Discret. Math. 39: 35-42 (2012) - [j1]Gilberto Farias de Sousa Filho, Ivan Quirino do Nascimento, Juliana Holanda Correia, Lucídio dos Anjos Formiga Cabral, Roberto Quirino do Nascimento
Optimization and implementation of a system for allocating services integrated with the Google Maps service. OR Insight 25(4): 254-265 (2012) - [c2]Gilberto Farias de Sousa Filho, Bruno Jefferson de S. Pessoa, José Jorge Lima Dias Jr., Lucídio dos Anjos Formiga Cabral:
Uma Arquitetura e Ferramentas para Problemas de Localização de Facilidades no Setor Público. SBSI 2012: 459-470
2000 – 2009
- 2006
- [c1]Thayse Christine S. Dias, Gilberto Farias de Sousa Filho, Elder M. Macambira, Lucídio dos Anjos F. Cabral, Marcia Helena Costa Fampa:
An Efficient Heuristic for the Ring Star Problem. WEA 2006: 24-35
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-10-07 21:19 CEST 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: