Iago A. Carvalho

Orcid: 0000-0001-9404-1329

Affiliations:
  • University of Campinas, Institute of Computing, Brazil
  • Federal University of Minas Gerais, Department of Computer Science, Brazil (PhD 2020)


According to our database1, Iago A. Carvalho authored at least 23 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On solving bi-objective constrained minimum spanning tree problems.
J. Glob. Optim., September, 2023

An island-based hybrid evolutionary algorithm for caloric-restricted diets.
Evol. Intell., April, 2023

The widest <i>k</i>-set of disjoint paths problem.
RAIRO Oper. Res., January, 2023

A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty.
Int. Trans. Oper. Res., 2023

2022
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty.
RAIRO Oper. Res., November, 2022

2021
On the fast delivery problem with one or two packages.
J. Comput. Syst. Sci., 2021

The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints.
Proceedings of the XLVII Latin American Computing Conference, 2021

2020
Optimal Energy Efficiency and Throughput on Partially Reversible Pipelined QCA Circuits.
IEEE Des. Test, 2020

An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem.
Ann. Oper. Res., 2020

Forecasting Soccer Market Tendencies Using Link Prediction.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

2019
A node-depth phylogenetic-based artificial immune system for multi-objective Network Design Problems.
Swarm Evol. Comput., 2019

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., 2019

On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions.
Inf. Process. Lett., 2019

Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data.
CoRR, 2019

An Efficient Algorithm for the Fast Delivery Problem.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
A MILP-based VND for the <i>min-max</i> regret Shortest Path Tree Problem with interval costs.
Electron. Notes Discret. Math., 2018

Improving Energy Efficiency on Partially Reversible Pipelined QCA Circuits.
Proceedings of the 31st Symposium on Integrated Circuits and Systems Design, 2018

Improving Energy Efficiency of Field-Coupled Nanocomputing Circuits by Evolutionary Synthesis.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
A Differential Evolution Algorithm for Computing Caloric-Restricted Diets - Island-Based Model.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Study of Parameter Sensitivity on Bat Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Solving a Multiobjective Caloric-Restricted Diet Problem using Differential Evolution.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem.
Proceedings of the 2017 Brazilian Conference on Intelligent Systems, 2017

2016
Developing Tasty Calorie Restricted Diets Using a Differential Evolution Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016


  Loading...