default search action
Ivan Reinaldo Meneghini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Mateus Clemente de Sousa, Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães:
A clustering-based coevolutionary multi-objective evolutionary algorithm for handling robust and noisy optimization. Evol. Intell. 17(5): 3767-3791 (2024) - 2023
- [c6]Mateus Clemente de Sousa, Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães:
Assessment of Robust Multi-objective Evolutionary Algorithms on Robust and Noisy Environments. BRACIS (3) 2023: 33-48 - 2022
- [j4]Paulo Pinheiro Junqueira, Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães:
Multi-objective evolutionary algorithm based on decomposition with an external archive and local-neighborhood based adaptation of weights. Swarm Evol. Comput. 71: 101079 (2022) - 2021
- [c5]Paulo Pinheiro Junqueira, Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães:
Local Neighborhood-Based Adaptation of Weights in Multi-Objective Evolutionary Algorithms Based on Decomposition. CEC 2021: 1454-1461 - 2020
- [j3]Ivan Reinaldo Meneghini, Marcos Antonio Alves, António Gaspar-Cunha, Frederico Gadelha Guimarães:
Scalable and customizable benchmark problems for many-objective optimization. Appl. Soft Comput. 90: 106139 (2020) - [i1]Ivan Reinaldo Meneghini, Marcos Antonio Alves, António Gaspar-Cunha, Frederico Gadelha Guimarães:
Scalable and Customizable Benchmark Problems for Many-Objective Optimization. CoRR abs/2001.11591 (2020)
2010 – 2019
- 2019
- [j2]Luciano Perdigão Cota, Frederico G. Guimarães, Roberto G. Ribeiro, Ivan Reinaldo Meneghini, Fernando B. de Oliveira, Marcone J. F. Souza, Patrick Siarry:
An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem. Swarm Evol. Comput. 51 (2019) - 2018
- [c4]Ivan Reinaldo Meneghini, Roozbeh Haghnazar Koochaksaraei, Frederico G. Guimarães, António Gaspar-Cunha:
Information to the Eye of the Beholder: Data Visualization for Many-Objective Optimization. CEC 2018: 1-8 - 2017
- [j1]Roozbeh Haghnazar Koochaksaraei, Ivan Reinaldo Meneghini, Vitor Nazário Coelho, Frederico Gadelha Guimarães:
A new visualization method in many-objective optimization with chord diagram and angular mapping. Knowl. Based Syst. 138: 134-154 (2017) - [c3]Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães:
Evolutionary method for weight vector generation in Multi-Objective Evolutionary Algorithms based on decomposition and aggregation. CEC 2017: 1900-1907 - 2016
- [c2]Ivan Reinaldo Meneghini, Frederico Gadelha Guimarães, António Gaspar-Cunha:
Competitive coevolutionary algorithm for robust multi-objective optimization: The worst case minimization. CEC 2016: 586-593 - [c1]Vitor Nazário Coelho, Igor Machado Coelho, Ivan Reinaldo Meneghini, Marcone J. F. Souza, Frederico G. Guimarães:
An automatic calibration framework applied on a metaheuristic fuzzy model for the CIF competition. IJCNN 2016: 1507-1514
Coauthor Index
aka: Frederico Gadelha Guimarães
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-30 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint