default search action
Isabel Rosseti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Maicon Banni
, Maria Luiza Furtuozo Falci, Isabel Rosseti
Hurricane: a Dataflow-oriented Data Service for Smart Cities Applications. J. Inf. Data Manag. 14(1) (2023) - 2022
- [j19]Murilo B. Stockinger, Marcos A. Guerine, Ubiratam de Paula Junior, Filipe Santiago, Yuri Frota, Isabel Rosseti
A Provenance-based Execution Strategy for Variant GPU-accelerated Scientific Workflows in Clouds. J. Grid Comput. 20(4): 36 (2022) - [j18]Ítalo Santana
Improving a state-of-the-art heuristic for the minimum latency problem with data mining. Int. Trans. Oper. Res. 29(2): 959-986 (2022) - [j17]Bruno Cunha Sá, Gustavo Muller, Maicon Banni, Wagner Santos, Marcos Lage, Isabel Rosseti, Yuri Frota, Daniel de Oliveira:
PolRoute-DS: a Crime Dataset for Optimization-based Police Patrol Routing. J. Inf. Data Manag. 13(1) (2022) - [c9]Marcelo Rodrigues de Holanda Maia
MineReduce-Based Metaheuristic for the Minimum Latency Problem. MIC 2022: 88-102 - [c8]Maicon Banni, Isabel Rosseti, Daniel de Oliveira
HURRICANE: um Serviço para Gerência de Dados de Aplicações de Cidades Inteligentes. SBBD 2022: 151-163 - 2021
- [j16]Glaubos Clímaco
Reactive GRASP for the Prize-collecting Covering Tour Problem. RAIRO Oper. Res. 55(3): 1441-1457 (2021) - [j15]Glaubos Clímaco
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem. RAIRO Oper. Res. 55(Supplement): S719-S726 (2021) - [j14]Bruno Q. Pinto, Celso C. Ribeiro
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. RAIRO Oper. Res. 55(Supplement): S741-S763 (2021) - 2020
- [j13]Marcos A. Guerine, Isabel Rosseti
A hybrid data mining heuristic to solve the point-feature cartographic label placement problem. Int. Trans. Oper. Res. 27(2): 1189-1209 (2020) - [j12]Bruno Q. Pinto, Celso C. Ribeiro
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model. J. Glob. Optim. 77(4): 949-973 (2020)
2010 – 2019
- 2019
- [j11]Marcos A. Guerine, Murilo B. Stockinger, Isabel Rosseti
A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows. Future Gener. Comput. Syst. 97: 697-713 (2019) - [j10]Glaubos Clímaco, Isabel Rosseti
Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem. Int. Trans. Oper. Res. 26(2): 615-641 (2019) - 2018
- [j9]Daniel Martins, Gabriel M. Vianna, Isabel Rosseti
Making a state-of-the-art heuristic faster with data mining. Ann. Oper. Res. 263(1-2): 141-162 (2018) - [j8]Bruno Q. Pinto, Celso C. Ribeiro
A biased random-key genetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 271(3): 849-865 (2018) - [r1]Simone de Lima Martins, Isabel Rosseti, Alexandre Plastino:
Data Mining in Stochastic Local Search. Handbook of Heuristics 2018: 39-87 - 2017
- [c7]Wilton de Paula Filho, Isabel Rosseti
On tweets, retweets, hashtags and user profiles in the 2016 American Presidential Election Scene. DG.O 2017: 120-128 - [c6]Isabel Rosseti
Towards preserving results confidentiality in cloud-based scientific workflows. WORKS@SC 2017: 6:1-6:9 - 2016
- [j7]Marcos A. Guerine, Isabel Rosseti
Extending the hybridization of metaheuristics with data mining: Dealing with sequences. Intell. Data Anal. 20(5): 1133-1156 (2016) - 2015
- [j6]Celso C. Ribeiro
tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optim. Lett. 9(3): 601-614 (2015) - 2014
- [c5]Marcos A. Guerine, Isabel Rosseti
Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain. ICEIS (1) 2014: 395-406 - 2013
- [j5]Hugo Barbalho, Isabel Rosseti
A hybrid data mining GRASP with path-relinking. Comput. Oper. Res. 40(12): 3159-3173 (2013) - [j4]Celso C. Ribeiro
Probabilistic stopping rules for GRASP heuristics and extensions. Int. Trans. Oper. Res. 20(3): 301-323 (2013) - 2012
- [j3]Celso C. Ribeiro
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Glob. Optim. 54(2): 405-429 (2012) - 2011
- [c4]Celso C. Ribeiro
Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations. LION 2011: 146-160
2000 – 2009
- 2009
- [c3]Celso C. Ribeiro
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms. SLS 2009: 16-30 - 2007
- [j2]Celso C. Ribeiro
Metaheuristics for optimization problems in computer communications. Comput. Commun. 30(4): 656-669 (2007) - [j1]Celso C. Ribeiro
Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33(1): 21-35 (2007) - 2004
- [c2]Simone L. Martins, Celso C. Ribeiro
Applications and Parallel Implementations of Metaheuristics in Network Design and Routing. AACC 2004: 205-213 - 2002
- [c1]Celso C. Ribeiro
A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note). Euro-Par 2002: 922-926
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 22:11 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: