Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIago A. Carvalho
Person information
- affiliation: University of Campinas, Institute of Computing, Brazil
- affiliation (PhD 2020): Federal University of Minas Gerais, Department of Computer Science, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Carolina Ribeiro Xavier
, João Gabriel Rocha Silva, Grasiele Regina Duarte, Iago Augusto de Carvalho, Vinícius da Fonseca Vieira, Leonardo Goliatt:
An island-based hybrid evolutionary algorithm for caloric-restricted diets. Evol. Intell. 16(2): 553-564 (2023)- [j11]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira, Vinícius Fernandes dos Santos:
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. Int. Trans. Oper. Res. 30(2): 1120-1143 (2023) - [j10]Iago A. Carvalho, Amadeu Almeida Coco:
On solving bi-objective constrained minimum spanning tree problems. J. Glob. Optim. 87(1): 301-323 (2023) - [j9]Marco A. Ribeiro, Iago Augusto de Carvalho, Armando Honorio Pereira:
The widest k-set of disjoint paths problem. RAIRO Oper. Res. 57(1): 87-97 (2023) - 2022
- [j8]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty. RAIRO Oper. Res. 56(6): 4281-4301 (2022) - 2021
- [j7]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. 115: 246-263 (2021) - 2020
- [j6]Iago A. Carvalho, Marco A. Ribeiro:
An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem. Ann. Oper. Res. 287(1): 109-126 (2020) - [j5]Marco A. Ribeiro, Iago A. Carvalho, Omar P. Vilela Neto, Jeferson F. Chaves:
Optimal Energy Efficiency and Throughput on Partially Reversible Pipelined QCA Circuits. IEEE Des. Test 37(3): 40-50 (2020) - 2019
- [j4]Iago A. Carvalho:
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions. Inf. Process. Lett. 143: 24-27 (2019) - [j3]Lucas Gabriel da Silva Félix, Carlos M. Barbosa, Iago A. Carvalho, Vinícius F. Vieira, Carolina Ribeiro Xavier:
Uma análise das seleções da Copa do Mundo de Futebol 2018 utilizando uma rede de transferências de jogadores entre países. Braz. J. Inf. Syst. 12(3): 73-93 (2019) - [j2]Iago A. Carvalho, Marco A. Ribeiro:
A node-depth phylogenetic-based artificial immune system for multi-objective Network Design Problems. Swarm Evol. Comput. 50 (2019) - 2018
- [j1]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira:
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs. Electron. Notes Discret. Math. 66: 39-46 (2018)
Conference and Workshop Papers
- 2021
- [c10]Eduardo T. Bogue, Marcos V. A. Guimarães, Thiago F. Noronha, Armando Honorio Pereira, Iago A. Carvalho, Sebastián Urrutia:
The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. CLEI 2021: 1-9 - 2020
- [c9]Lucas G. S. Félix, Carlos M. Barbosa, Iago A. Carvalho, Vinícius da Fonseca Vieira, Carolina Ribeiro Xavier:
Forecasting Soccer Market Tendencies Using Link Prediction. ICCSA (1) 2020: 663-675 - 2019
- [c8]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. FCT 2019: 171-184 - 2018
- [c7]Marco A. Ribeiro, Iago A. Carvalho, Jeferson F. Chaves, Gisele L. Pappa, Omar P. Vilela Neto:
Improving Energy Efficiency of Field-Coupled Nanocomputing Circuits by Evolutionary Synthesis. CEC 2018: 1-8 - [c6]Marco A. Ribeiro, Iago A. Carvalho, Jeferson F. Chaves, Omar P. Vilela Neto:
Improving Energy Efficiency on Partially Reversible Pipelined QCA Circuits. SBCCI 2018: 1-6 - 2017
- [c5]Jose Ricardo Goncalves, Iago A. Carvalho, Thiago Ferreira Noronha:
An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem. BRACIS 2017: 378-383 - [c4]João Gabriel Rocha Silva, Heder Soares Bernardino, Helio José Corrêa Barbosa, Iago Augusto de Carvalho, Vinícius da Fonseca Vieira, Michelli Marlane Silva Loureiro, Carolina Ribeiro Xavier:
Solving a Multiobjective Caloric-Restricted Diet Problem using Differential Evolution. CEC 2017: 2062-2069 - [c3]João Gabriel Rocha Silva, Iago Augusto de Carvalho, Leonardo Goliatt, Vinícius da Fonseca Vieira, Carolina Ribeiro Xavier:
A Differential Evolution Algorithm for Computing Caloric-Restricted Diets - Island-Based Model. ICCSA (1) 2017: 385-400 - [c2]Iago Augusto de Carvalho, Daniel G. da Rocha, João Gabriel Rocha Silva, Vinícius da Fonseca Vieira, Carolina Ribeiro Xavier:
Study of Parameter Sensitivity on Bat Algorithm. ICCSA (1) 2017: 494-508 - 2016
- [c1]João Gabriel Rocha Silva, Iago Augusto de Carvalho, Michelli Marlane Silva Loureiro, Vinícius da Fonseca Vieira, Carolina Ribeiro Xavier:
Developing Tasty Calorie Restricted Diets Using a Differential Evolution Algorithm. ICCSA (5) 2016: 171-186
Informal and Other Publications
- 2019
- [i3]Iago A. Carvalho:
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions. CoRR abs/1902.00101 (2019) - [i2]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. CoRR abs/1904.09142 (2019) - [i1]Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data. CoRR abs/1908.05082 (2019)
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-07-09 04:36 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:
