default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriela F. Minetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Carolina Salto
, Gabriela F. Minetti, Enrique Alba, Gabriel Luque:
Big optimization with genetic algorithms: Hadoop, Spark, and MPI. Soft Comput. 27(16): 11469-11484 (2023)- 2021
- [c9]Carlos Bermúdez, Hugo Alfonso, Gabriela F. Minetti, Carolina Salto:
Internal Behavior Analysis of SA Using Adaptive Strategies to Set the Markov Chain Length. CACIC 2021: 3-17 - [c8]Carlos Bermúdez, Hugo Alfonso, Gabriela F. Minetti, Carolina Salto:
A Parallel Optimization Solver for the Multi-period WDND Problem. HAIS 2021: 625-636 - 2020
- [j5]Gabriela F. Minetti, José Hernandez, Mercedes Carnero, Carolina Salto, Carlos Bermudez, Mabel Sanchez:
Tuning a hybrid SA based algorithm applied to Optimal Sensor Network Design. J. Comput. Sci. Technol. 20(1): 03 (2020) - [c7]Carlos Bermudez, Hugo Alfonso, Gabriela F. Minetti, Carolina Salto:
Hybrid Simulated Annealing to Optimize the Water Distribution Network Design: A Real Case. CACIC 2020: 19-34
2010 – 2019
- 2018
- [j4]Gabriela F. Minetti, Carolina Salto:
Artificial Bee Colony Algorithm Improved with Evolutionary Operators. J. Comput. Sci. Technol. 18(02): 13 (2018) - [c6]Carlos Bermudez, Carolina Salto, Gabriela F. Minetti:
Solving the Multi-Period Water Distribution Network Design Problem with a Hybrid Simulated Anealling. CACIC 2018: 3-16 - [c5]Carolina Salto, Gabriela F. Minetti, Enrique Alba, Gabriel Luque:
Developing Genetic Algorithms Using Different MapReduce Frameworks: MPI vs. Hadoop. CAEPIA 2018: 262-272 - 2017
- [j3]Gabriela F. Minetti, Gabriel Luque, Enrique Alba:
The Problem Aware Local Search algorithm: an efficient technique for permutation-based problems. Soft Comput. 21(18): 5193-5206 (2017) - 2014
- [j2]Gabriela F. Minetti, Guillermo Leguizamón, Enrique Alba:
An improved trajectory-based hybrid metaheuristic applied to the noisy DNA Fragment Assembly Problem. Inf. Sci. 277: 273-283 (2014) - 2010
- [c4]Gabriela F. Minetti, Enrique Alba:
Metaheuristic assemblers of DNA strands: Noiseless and noisy cases. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2008
- [j1]Gabriela F. Minetti, Enrique Alba, Gabriel Luque:
Seeding strategies and recombination operators for solving the DNA fragment assembly problem. Inf. Process. Lett. 108(3): 94-100 (2008) - [c3]Gabriela F. Minetti, Gabriel Luque, Enrique Alba:
Variable Neighborhood Search as Genetic Algorithm Operator for DNA Fragment Assembling Problem. HIS 2008: 714-719 - 2005
- [c2]Gabriela F. Minetti, Hugo Alfonso:
Variable Size Population in Parallel Evolutionary Algorithms. ISDA 2005: 350-355 - 2004
- [c1]Vanina Beraudo, Hugo Alfonso, Gabriela F. Minetti, Carolina Salto:
Constrained Two-Dimensional Non-Guillotine Cutting Problem: an Evolutionary Approach. SCCC 2004: 84-89
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-04-24 23:12 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:
